/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/mix053_tso.oepc.i


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


This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788
[2021-06-01 16:18:30,110 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-06-01 16:18:30,111 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-01 16:18:30,144 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-01 16:18:30,144 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-01 16:18:30,147 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-01 16:18:30,148 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-01 16:18:30,152 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-01 16:18:30,154 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-01 16:18:30,157 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-01 16:18:30,157 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-06-01 16:18:30,158 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-01 16:18:30,158 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-01 16:18:30,159 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-01 16:18:30,159 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-01 16:18:30,160 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-01 16:18:30,160 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-01 16:18:30,161 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-01 16:18:30,161 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-01 16:18:30,162 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-01 16:18:30,163 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-01 16:18:30,164 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-01 16:18:30,165 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-06-01 16:18:30,166 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-01 16:18:30,169 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-01 16:18:30,169 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-01 16:18:30,169 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-01 16:18:30,170 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-01 16:18:30,170 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-01 16:18:30,171 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-01 16:18:30,171 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-01 16:18:30,171 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-01 16:18:30,172 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-01 16:18:30,172 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-01 16:18:30,173 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-01 16:18:30,173 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-01 16:18:30,173 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-01 16:18:30,173 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-01 16:18:30,173 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-01 16:18:30,174 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-01 16:18:30,174 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-06-01 16:18:30,177 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-01 16:18:30,199 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-06-01 16:18:30,199 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-01 16:18:30,200 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-01 16:18:30,200 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-01 16:18:30,200 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-01 16:18:30,201 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-06-01 16:18:30,201 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-06-01 16:18:30,201 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-01 16:18:30,201 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-06-01 16:18:30,201 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-06-01 16:18:30,201 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-06-01 16:18:30,201 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-06-01 16:18:30,201 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-06-01 16:18:30,201 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-01 16:18:30,201 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-06-01 16:18:30,201 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-06-01 16:18:30,202 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-06-01 16:18:30,202 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-06-01 16:18:30,202 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-06-01 16:18:30,202 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-01 16:18:30,202 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-06-01 16:18:30,202 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-06-01 16:18:30,202 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-06-01 16:18:30,202 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 16:18:30,202 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-01 16:18:30,202 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-06-01 16:18:30,203 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-01 16:18:30,203 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-06-01 16:18:30,203 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-01 16:18:30,203 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-06-01 16:18:30,203 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-01 16:18:30,203 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-01 16:18:30,421 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-01 16:18:30,439 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-01 16:18:30,440 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-01 16:18:30,441 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-06-01 16:18:30,442 INFO  L275        PluginConnector]: CDTParser initialized
[2021-06-01 16:18:30,443 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i
[2021-06-01 16:18:30,484 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2e71e69/e3bf9b8e56254c04afeb0db3ea591acb/FLAGcf4271a73
[2021-06-01 16:18:30,875 INFO  L306              CDTParser]: Found 1 translation units.
[2021-06-01 16:18:30,875 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_tso.oepc.i
[2021-06-01 16:18:30,891 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2e71e69/e3bf9b8e56254c04afeb0db3ea591acb/FLAGcf4271a73
[2021-06-01 16:18:30,905 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d2e71e69/e3bf9b8e56254c04afeb0db3ea591acb
[2021-06-01 16:18:30,906 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-01 16:18:30,908 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-01 16:18:30,910 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-01 16:18:30,910 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-01 16:18:30,913 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-01 16:18:30,914 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:18:30" (1/1) ...
[2021-06-01 16:18:30,914 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7546f266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:30, skipping insertion in model container
[2021-06-01 16:18:30,914 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:18:30" (1/1) ...
[2021-06-01 16:18:30,918 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-06-01 16:18:30,967 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-06-01 16:18:31,146 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/mix053_tso.oepc.i[949,962]
[2021-06-01 16:18:31,301 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-01 16:18:31,309 INFO  L203         MainTranslator]: Completed pre-run
[2021-06-01 16:18:31,316 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/mix053_tso.oepc.i[949,962]
[2021-06-01 16:18:31,346 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-01 16:18:31,398 INFO  L208         MainTranslator]: Completed translation
[2021-06-01 16:18:31,399 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31 WrapperNode
[2021-06-01 16:18:31,399 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-01 16:18:31,400 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-01 16:18:31,400 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-01 16:18:31,400 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-01 16:18:31,404 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (1/1) ...
[2021-06-01 16:18:31,414 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (1/1) ...
[2021-06-01 16:18:31,433 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-01 16:18:31,433 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-01 16:18:31,433 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-01 16:18:31,433 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-06-01 16:18:31,438 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (1/1) ...
[2021-06-01 16:18:31,438 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (1/1) ...
[2021-06-01 16:18:31,441 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (1/1) ...
[2021-06-01 16:18:31,441 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (1/1) ...
[2021-06-01 16:18:31,453 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (1/1) ...
[2021-06-01 16:18:31,462 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (1/1) ...
[2021-06-01 16:18:31,464 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (1/1) ...
[2021-06-01 16:18:31,467 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-01 16:18:31,467 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-01 16:18:31,467 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-06-01 16:18:31,467 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-06-01 16:18:31,468 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (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-01 16:18:31,528 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-06-01 16:18:31,528 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-01 16:18:31,528 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-01 16:18:31,529 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-01 16:18:31,529 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-06-01 16:18:31,530 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-06-01 16:18:31,531 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-06-01 16:18:31,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-06-01 16:18:31,531 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-06-01 16:18:31,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-06-01 16:18:31,532 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2021-06-01 16:18:31,532 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2021-06-01 16:18:31,532 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-01 16:18:31,532 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-01 16:18:31,532 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-01 16:18:31,535 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-01 16:18:31,537 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-06-01 16:18:32,879 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-01 16:18:32,879 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-01 16:18:32,881 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:18:32 BoogieIcfgContainer
[2021-06-01 16:18:32,881 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-01 16:18:32,882 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-01 16:18:32,882 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-06-01 16:18:32,883 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-06-01 16:18:32,884 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.06 04:18:30" (1/3) ...
[2021-06-01 16:18:32,884 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea7688f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:18:32, skipping insertion in model container
[2021-06-01 16:18:32,884 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:18:31" (2/3) ...
[2021-06-01 16:18:32,884 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ea7688f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:18:32, skipping insertion in model container
[2021-06-01 16:18:32,884 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:18:32" (3/3) ...
[2021-06-01 16:18:32,885 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i
[2021-06-01 16:18:32,889 WARN  L148   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-01 16:18:32,889 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-01 16:18:32,889 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-01 16:18:32,890 INFO  L471   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-01 16:18:32,911 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,911 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,911 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,911 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,911 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,912 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,913 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,914 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,914 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,914 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,914 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,914 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,914 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,914 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,914 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,915 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,916 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,916 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,916 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,916 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,916 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,917 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,918 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,918 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,918 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,918 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,918 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,919 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,920 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,920 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,920 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,920 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,920 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,920 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,920 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,920 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,921 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,921 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,921 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,922 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,922 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,922 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,922 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,922 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,922 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,922 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,922 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,923 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,923 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,924 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,924 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,924 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,924 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,924 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,924 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,924 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,924 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,925 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,925 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,925 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,926 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,926 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,926 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,926 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,927 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,927 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,927 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,927 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:18:32,928 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-01 16:18:32,941 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 16:18:32,951 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:18:32,952 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 16:18:32,952 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:18:32,952 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:18:32,952 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:18:32,952 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 16:18:32,952 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:18:32,952 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2========
[2021-06-01 16:18:32,958 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 126 transitions, 272 flow
[2021-06-01 16:18:50,292 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 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-01 16:18:50,463 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 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-01 16:18:51,171 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 16:18:51,172 INFO  L301   ceAbstractionStarter]: Result for error location P2 was SAFE (1/3)
[2021-06-01 16:18:51,173 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 16:18:51,184 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:18:51,184 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 16:18:51,184 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:18:51,184 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:18:51,184 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:18:51,208 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 16:18:51,209 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:18:51,209 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork2========
[2021-06-01 16:18:51,216 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 126 transitions, 272 flow
[2021-06-01 16:19:07,856 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 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-01 16:19:07,999 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 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-01 16:19:08,001 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2021-06-01 16:19:08,001 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:08,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]
[2021-06-01 16:19:08,002 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:08,005 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:08,005 INFO  L82        PathProgramCache]: Analyzing trace with hash 141610343, now seen corresponding path program 1 times
[2021-06-01 16:19:08,010 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:08,011 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228003132]
[2021-06-01 16:19:08,011 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:08,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:08,476 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-01 16:19:08,476 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:08,476 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228003132]
[2021-06-01 16:19:08,477 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228003132] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:08,477 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:08,477 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-01 16:19:08,477 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434296082]
[2021-06-01 16:19:08,480 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-01 16:19:08,480 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:08,486 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-01 16:19:08,487 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:19:08,625 INFO  L87              Difference]: Start difference. First operand  has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 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 29.5) internal successors, (59), 3 states have internal predecessors, (59), 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-01 16:19:09,773 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:09,773 INFO  L93              Difference]: Finished difference Result 103972 states and 458725 transitions.
[2021-06-01 16:19:09,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-01 16:19:09,790 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 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 59
[2021-06-01 16:19:09,790 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:09,793 INFO  L225             Difference]: With dead ends: 103972
[2021-06-01 16:19:09,793 INFO  L226             Difference]: Without dead ends: 0
[2021-06-01 16:19:09,794 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:19:09,804 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-01 16:19:09,807 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-01 16:19:09,807 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-01 16:19:09,807 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-01 16:19:09,808 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 59
[2021-06-01 16:19:09,808 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:09,808 INFO  L482      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-01 16:19:09,808 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 2 states have (on average 29.5) internal successors, (59), 3 states have internal predecessors, (59), 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-01 16:19:09,808 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-01 16:19:09,808 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 16:19:09,809 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-01 16:19:09,809 INFO  L301   ceAbstractionStarter]: Result for error location P2Thread1of1ForFork2 was SAFE (2/3)
[2021-06-01 16:19:09,809 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2021-06-01 16:19:09,810 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:19:09,810 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 16:19:09,810 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:19:09,810 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:19:09,811 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:19:09,811 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 16:19:09,811 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:19:09,811 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-01 16:19:09,827 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 126 transitions, 272 flow
[2021-06-01 16:19:25,630 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 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-01 16:19:25,778 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 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-01 16:19:25,809 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2021-06-01 16:19:25,809 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:25,809 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-01 16:19:25,810 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:25,810 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:25,810 INFO  L82        PathProgramCache]: Analyzing trace with hash -1715132353, now seen corresponding path program 1 times
[2021-06-01 16:19:25,810 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:25,814 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128767431]
[2021-06-01 16:19:25,814 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:25,876 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:25,967 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-01 16:19:25,968 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:25,972 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128767431]
[2021-06-01 16:19:25,973 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128767431] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:25,973 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:25,973 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:19:25,973 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993686871]
[2021-06-01 16:19:25,974 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:19:25,974 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:25,975 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:19:25,975 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:19:26,107 INFO  L87              Difference]: Start difference. First operand  has 120940 states, 120936 states have (on average 4.495964807832242) internal successors, (543724), 120939 states have internal predecessors, (543724), 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 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-01 16:19:27,442 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:27,442 INFO  L93              Difference]: Finished difference Result 173644 states and 766936 transitions.
[2021-06-01 16:19:27,442 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 16:19:27,443 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-01 16:19:27,443 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:28,037 INFO  L225             Difference]: With dead ends: 173644
[2021-06-01 16:19:28,037 INFO  L226             Difference]: Without dead ends: 61900
[2021-06-01 16:19:28,038 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 71.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:19:28,478 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61900 states.
[2021-06-01 16:19:29,904 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61900 to 61900.
[2021-06-01 16:19:29,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 61900 states, 61898 states have (on average 4.35426023457947) internal successors, (269520), 61899 states have internal predecessors, (269520), 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-01 16:19:30,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61900 states to 61900 states and 269520 transitions.
[2021-06-01 16:19:30,259 INFO  L78                 Accepts]: Start accepts. Automaton has 61900 states and 269520 transitions. Word has length 78
[2021-06-01 16:19:30,260 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:30,260 INFO  L482      AbstractCegarLoop]: Abstraction has 61900 states and 269520 transitions.
[2021-06-01 16:19:30,261 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-01 16:19:30,261 INFO  L276                IsEmpty]: Start isEmpty. Operand 61900 states and 269520 transitions.
[2021-06-01 16:19:30,317 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2021-06-01 16:19:30,317 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:30,317 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]
[2021-06-01 16:19:30,317 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-01 16:19:30,317 INFO  L430      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:30,318 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:30,318 INFO  L82        PathProgramCache]: Analyzing trace with hash 1014819008, now seen corresponding path program 1 times
[2021-06-01 16:19:30,318 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:30,318 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489411431]
[2021-06-01 16:19:30,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:30,354 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:30,508 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-01 16:19:30,509 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:30,509 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489411431]
[2021-06-01 16:19:30,509 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489411431] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:30,509 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:30,509 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:19:30,509 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877717408]
[2021-06-01 16:19:30,510 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:19:30,510 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:30,510 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:19:30,510 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:19:30,511 INFO  L87              Difference]: Start difference. First operand 61900 states and 269520 transitions. Second operand  has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 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-01 16:19:31,385 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:31,386 INFO  L93              Difference]: Finished difference Result 73357 states and 316553 transitions.
[2021-06-01 16:19:31,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-06-01 16:19:31,386 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 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 80
[2021-06-01 16:19:31,387 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:31,939 INFO  L225             Difference]: With dead ends: 73357
[2021-06-01 16:19:31,940 INFO  L226             Difference]: Without dead ends: 59197
[2021-06-01 16:19:31,941 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 160.6ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306
[2021-06-01 16:19:32,219 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59197 states.
[2021-06-01 16:19:33,159 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59197 to 59197.
[2021-06-01 16:19:33,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59197 states, 59195 states have (on average 4.336937241321057) internal successors, (256725), 59196 states have internal predecessors, (256725), 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-01 16:19:33,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59197 states to 59197 states and 256725 transitions.
[2021-06-01 16:19:33,693 INFO  L78                 Accepts]: Start accepts. Automaton has 59197 states and 256725 transitions. Word has length 80
[2021-06-01 16:19:33,693 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:33,693 INFO  L482      AbstractCegarLoop]: Abstraction has 59197 states and 256725 transitions.
[2021-06-01 16:19:33,693 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 8.0) internal successors, (80), 10 states have internal predecessors, (80), 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-01 16:19:33,694 INFO  L276                IsEmpty]: Start isEmpty. Operand 59197 states and 256725 transitions.
[2021-06-01 16:19:33,745 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2021-06-01 16:19:33,745 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:33,745 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-01 16:19:33,745 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-01 16:19:33,745 INFO  L430      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:33,746 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:33,746 INFO  L82        PathProgramCache]: Analyzing trace with hash 1812189310, now seen corresponding path program 1 times
[2021-06-01 16:19:33,746 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:33,746 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064247490]
[2021-06-01 16:19:33,746 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:33,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:33,891 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-01 16:19:33,892 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:33,892 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064247490]
[2021-06-01 16:19:33,894 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064247490] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:33,894 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:33,894 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:19:33,895 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142122134]
[2021-06-01 16:19:33,895 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:19:33,895 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:33,896 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:19:33,896 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:19:33,896 INFO  L87              Difference]: Start difference. First operand 59197 states and 256725 transitions. Second operand  has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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-01 16:19:34,835 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:34,835 INFO  L93              Difference]: Finished difference Result 70005 states and 302347 transitions.
[2021-06-01 16:19:34,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-06-01 16:19:34,836 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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-01 16:19:34,836 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:35,024 INFO  L225             Difference]: With dead ends: 70005
[2021-06-01 16:19:35,024 INFO  L226             Difference]: Without dead ends: 59701
[2021-06-01 16:19:35,025 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 197.2ms TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342
[2021-06-01 16:19:35,284 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59701 states.
[2021-06-01 16:19:36,581 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59701 to 59365.
[2021-06-01 16:19:36,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59365 states, 59363 states have (on average 4.336758586998635) internal successors, (257443), 59364 states have internal predecessors, (257443), 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-01 16:19:36,845 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59365 states to 59365 states and 257443 transitions.
[2021-06-01 16:19:36,845 INFO  L78                 Accepts]: Start accepts. Automaton has 59365 states and 257443 transitions. Word has length 81
[2021-06-01 16:19:36,845 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:36,845 INFO  L482      AbstractCegarLoop]: Abstraction has 59365 states and 257443 transitions.
[2021-06-01 16:19:36,846 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 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-01 16:19:36,846 INFO  L276                IsEmpty]: Start isEmpty. Operand 59365 states and 257443 transitions.
[2021-06-01 16:19:36,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2021-06-01 16:19:36,897 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:36,897 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]
[2021-06-01 16:19:36,897 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-01 16:19:36,898 INFO  L430      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:36,898 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:36,898 INFO  L82        PathProgramCache]: Analyzing trace with hash 506128351, now seen corresponding path program 1 times
[2021-06-01 16:19:36,898 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:36,898 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352283791]
[2021-06-01 16:19:36,898 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:36,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:37,080 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-01 16:19:37,081 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:37,081 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352283791]
[2021-06-01 16:19:37,081 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352283791] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:37,081 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:37,081 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-01 16:19:37,083 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169944258]
[2021-06-01 16:19:37,083 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-01 16:19:37,083 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:37,085 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-01 16:19:37,085 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:19:37,085 INFO  L87              Difference]: Start difference. First operand 59365 states and 257443 transitions. Second operand  has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-01 16:19:38,237 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:38,237 INFO  L93              Difference]: Finished difference Result 70677 states and 305919 transitions.
[2021-06-01 16:19:38,238 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2021-06-01 16:19:38,238 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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 82
[2021-06-01 16:19:38,238 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:38,445 INFO  L225             Difference]: With dead ends: 70677
[2021-06-01 16:19:38,445 INFO  L226             Difference]: Without dead ends: 61717
[2021-06-01 16:19:38,445 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 236.3ms TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462
[2021-06-01 16:19:38,741 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61717 states.
[2021-06-01 16:19:40,079 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61717 to 60037.
[2021-06-01 16:19:40,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60037 states, 60035 states have (on average 4.333255600899475) internal successors, (260147), 60036 states have internal predecessors, (260147), 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-01 16:19:40,344 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60037 states to 60037 states and 260147 transitions.
[2021-06-01 16:19:40,344 INFO  L78                 Accepts]: Start accepts. Automaton has 60037 states and 260147 transitions. Word has length 82
[2021-06-01 16:19:40,345 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:40,345 INFO  L482      AbstractCegarLoop]: Abstraction has 60037 states and 260147 transitions.
[2021-06-01 16:19:40,345 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-01 16:19:40,345 INFO  L276                IsEmpty]: Start isEmpty. Operand 60037 states and 260147 transitions.
[2021-06-01 16:19:40,404 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2021-06-01 16:19:40,405 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:40,405 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]
[2021-06-01 16:19:40,405 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-01 16:19:40,405 INFO  L430      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:40,405 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:40,405 INFO  L82        PathProgramCache]: Analyzing trace with hash -681831777, now seen corresponding path program 1 times
[2021-06-01 16:19:40,406 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:40,406 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204502683]
[2021-06-01 16:19:40,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:40,420 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:40,468 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-01 16:19:40,468 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:40,469 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204502683]
[2021-06-01 16:19:40,469 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204502683] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:40,469 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:40,469 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-06-01 16:19:40,469 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676718454]
[2021-06-01 16:19:40,469 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-01 16:19:40,469 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:40,470 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-01 16:19:40,470 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:19:40,470 INFO  L87              Difference]: Start difference. First operand 60037 states and 260147 transitions. Second operand  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01 16:19:41,091 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:41,091 INFO  L93              Difference]: Finished difference Result 54476 states and 235039 transitions.
[2021-06-01 16:19:41,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-01 16:19:41,092 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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 83
[2021-06-01 16:19:41,092 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:41,272 INFO  L225             Difference]: With dead ends: 54476
[2021-06-01 16:19:41,272 INFO  L226             Difference]: Without dead ends: 54476
[2021-06-01 16:19:41,272 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:19:41,501 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54476 states.
[2021-06-01 16:19:42,513 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54476 to 54476.
[2021-06-01 16:19:42,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54476 states, 54475 states have (on average 4.314621385956861) internal successors, (235039), 54475 states have internal predecessors, (235039), 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-01 16:19:42,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54476 states to 54476 states and 235039 transitions.
[2021-06-01 16:19:42,793 INFO  L78                 Accepts]: Start accepts. Automaton has 54476 states and 235039 transitions. Word has length 83
[2021-06-01 16:19:42,794 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:42,794 INFO  L482      AbstractCegarLoop]: Abstraction has 54476 states and 235039 transitions.
[2021-06-01 16:19:42,794 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 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-01 16:19:42,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 54476 states and 235039 transitions.
[2021-06-01 16:19:42,852 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2021-06-01 16:19:42,853 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:42,853 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]
[2021-06-01 16:19:42,853 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-01 16:19:42,853 INFO  L430      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:42,853 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:42,854 INFO  L82        PathProgramCache]: Analyzing trace with hash -1650124958, now seen corresponding path program 1 times
[2021-06-01 16:19:42,854 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:42,854 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16766427]
[2021-06-01 16:19:42,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:42,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:43,000 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-01 16:19:43,000 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:43,000 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16766427]
[2021-06-01 16:19:43,001 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16766427] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:43,001 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:43,001 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:19:43,001 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147745395]
[2021-06-01 16:19:43,001 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:19:43,001 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:43,001 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:19:43,002 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:19:43,002 INFO  L87              Difference]: Start difference. First operand 54476 states and 235039 transitions. Second operand  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-01 16:19:43,462 WARN  L205               SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20
[2021-06-01 16:19:44,042 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:44,043 INFO  L93              Difference]: Finished difference Result 63422 states and 272751 transitions.
[2021-06-01 16:19:44,043 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-01 16:19:44,043 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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 83
[2021-06-01 16:19:44,043 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:44,205 INFO  L225             Difference]: With dead ends: 63422
[2021-06-01 16:19:44,205 INFO  L226             Difference]: Without dead ends: 56478
[2021-06-01 16:19:44,205 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 608.5ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272
[2021-06-01 16:19:44,438 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56478 states.
[2021-06-01 16:19:45,475 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56478 to 55694.
[2021-06-01 16:19:45,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 55694 states, 55693 states have (on average 4.318190795970768) internal successors, (240493), 55693 states have internal predecessors, (240493), 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-01 16:19:46,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55694 states to 55694 states and 240493 transitions.
[2021-06-01 16:19:46,038 INFO  L78                 Accepts]: Start accepts. Automaton has 55694 states and 240493 transitions. Word has length 83
[2021-06-01 16:19:46,038 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:46,038 INFO  L482      AbstractCegarLoop]: Abstraction has 55694 states and 240493 transitions.
[2021-06-01 16:19:46,038 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 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-01 16:19:46,038 INFO  L276                IsEmpty]: Start isEmpty. Operand 55694 states and 240493 transitions.
[2021-06-01 16:19:46,100 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2021-06-01 16:19:46,100 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:46,100 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]
[2021-06-01 16:19:46,101 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-01 16:19:46,101 INFO  L430      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:46,101 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:46,101 INFO  L82        PathProgramCache]: Analyzing trace with hash -1401534972, now seen corresponding path program 2 times
[2021-06-01 16:19:46,101 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:46,103 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137749637]
[2021-06-01 16:19:46,103 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:46,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:46,260 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-01 16:19:46,261 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:46,261 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137749637]
[2021-06-01 16:19:46,261 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137749637] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:46,261 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:46,261 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-01 16:19:46,261 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738342429]
[2021-06-01 16:19:46,261 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-01 16:19:46,261 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:46,262 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-01 16:19:46,262 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:19:46,262 INFO  L87              Difference]: Start difference. First operand 55694 states and 240493 transitions. Second operand  has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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-01 16:19:46,864 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:46,864 INFO  L93              Difference]: Finished difference Result 63422 states and 272639 transitions.
[2021-06-01 16:19:46,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-01 16:19:46,864 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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 83
[2021-06-01 16:19:46,865 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:47,023 INFO  L225             Difference]: With dead ends: 63422
[2021-06-01 16:19:47,024 INFO  L226             Difference]: Without dead ends: 56478
[2021-06-01 16:19:47,024 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 162.1ms TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306
[2021-06-01 16:19:47,659 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56478 states.
[2021-06-01 16:19:48,544 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56478 to 55582.
[2021-06-01 16:19:48,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 55582 states, 55581 states have (on average 4.319371727748691) internal successors, (240075), 55581 states have internal predecessors, (240075), 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-01 16:19:49,138 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55582 states to 55582 states and 240075 transitions.
[2021-06-01 16:19:49,139 INFO  L78                 Accepts]: Start accepts. Automaton has 55582 states and 240075 transitions. Word has length 83
[2021-06-01 16:19:49,139 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:49,139 INFO  L482      AbstractCegarLoop]: Abstraction has 55582 states and 240075 transitions.
[2021-06-01 16:19:49,139 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 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-01 16:19:49,139 INFO  L276                IsEmpty]: Start isEmpty. Operand 55582 states and 240075 transitions.
[2021-06-01 16:19:49,192 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2021-06-01 16:19:49,193 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:49,193 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]
[2021-06-01 16:19:49,193 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-01 16:19:49,193 INFO  L430      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:49,193 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:49,193 INFO  L82        PathProgramCache]: Analyzing trace with hash -303701536, now seen corresponding path program 3 times
[2021-06-01 16:19:49,194 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:49,194 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503357644]
[2021-06-01 16:19:49,194 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:49,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:49,294 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-01 16:19:49,295 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:49,295 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503357644]
[2021-06-01 16:19:49,295 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503357644] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:49,295 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:49,295 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-01 16:19:49,295 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698851469]
[2021-06-01 16:19:49,295 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-01 16:19:49,295 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:49,296 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-01 16:19:49,296 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-01 16:19:49,296 INFO  L87              Difference]: Start difference. First operand 55582 states and 240075 transitions. Second operand  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-01 16:19:49,801 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:49,802 INFO  L93              Difference]: Finished difference Result 67482 states and 290280 transitions.
[2021-06-01 16:19:49,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-01 16:19:49,802 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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 83
[2021-06-01 16:19:49,802 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:49,969 INFO  L225             Difference]: With dead ends: 67482
[2021-06-01 16:19:49,969 INFO  L226             Difference]: Without dead ends: 59642
[2021-06-01 16:19:49,969 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 112.6ms TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182
[2021-06-01 16:19:50,539 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59642 states.
[2021-06-01 16:19:51,483 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59642 to 56856.
[2021-06-01 16:19:51,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 56856 states, 56855 states have (on average 4.3125846451499426) internal successors, (245192), 56855 states have internal predecessors, (245192), 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-01 16:19:51,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56856 states to 56856 states and 245192 transitions.
[2021-06-01 16:19:51,730 INFO  L78                 Accepts]: Start accepts. Automaton has 56856 states and 245192 transitions. Word has length 83
[2021-06-01 16:19:51,730 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:51,730 INFO  L482      AbstractCegarLoop]: Abstraction has 56856 states and 245192 transitions.
[2021-06-01 16:19:51,730 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 10.375) internal successors, (83), 8 states have internal predecessors, (83), 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-01 16:19:51,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 56856 states and 245192 transitions.
[2021-06-01 16:19:51,800 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 16:19:51,801 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:51,801 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-01 16:19:51,801 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-01 16:19:51,801 INFO  L430      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:51,801 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:51,801 INFO  L82        PathProgramCache]: Analyzing trace with hash 1650711171, now seen corresponding path program 1 times
[2021-06-01 16:19:51,801 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:51,802 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089416832]
[2021-06-01 16:19:51,802 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:51,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:51,971 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-01 16:19:51,971 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:51,971 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089416832]
[2021-06-01 16:19:51,971 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089416832] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:51,971 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:51,971 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-01 16:19:51,971 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838101187]
[2021-06-01 16:19:51,972 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-01 16:19:51,972 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:51,972 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-01 16:19:51,972 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2021-06-01 16:19:51,972 INFO  L87              Difference]: Start difference. First operand 56856 states and 245192 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-01 16:19:52,926 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:52,927 INFO  L93              Difference]: Finished difference Result 92402 states and 394030 transitions.
[2021-06-01 16:19:52,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-01 16:19:52,927 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-01 16:19:52,927 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:53,221 INFO  L225             Difference]: With dead ends: 92402
[2021-06-01 16:19:53,221 INFO  L226             Difference]: Without dead ends: 86130
[2021-06-01 16:19:53,221 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 176.7ms TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342
[2021-06-01 16:19:53,534 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86130 states.
[2021-06-01 16:19:54,832 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86130 to 62946.
[2021-06-01 16:19:54,918 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 62946 states, 62945 states have (on average 4.309222336960839) internal successors, (271244), 62945 states have internal predecessors, (271244), 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-01 16:19:55,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 62946 states to 62946 states and 271244 transitions.
[2021-06-01 16:19:55,463 INFO  L78                 Accepts]: Start accepts. Automaton has 62946 states and 271244 transitions. Word has length 84
[2021-06-01 16:19:55,463 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:55,463 INFO  L482      AbstractCegarLoop]: Abstraction has 62946 states and 271244 transitions.
[2021-06-01 16:19:55,463 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-01 16:19:55,463 INFO  L276                IsEmpty]: Start isEmpty. Operand 62946 states and 271244 transitions.
[2021-06-01 16:19:55,541 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 16:19:55,541 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:55,541 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-01 16:19:55,541 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-01 16:19:55,541 INFO  L430      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:55,542 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:55,542 INFO  L82        PathProgramCache]: Analyzing trace with hash 1899301157, now seen corresponding path program 2 times
[2021-06-01 16:19:55,542 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:55,542 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624034192]
[2021-06-01 16:19:55,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:55,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:55,841 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-01 16:19:55,841 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:55,841 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624034192]
[2021-06-01 16:19:55,841 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624034192] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:55,841 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:55,841 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-01 16:19:55,841 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612039607]
[2021-06-01 16:19:55,842 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-01 16:19:55,842 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:55,842 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-01 16:19:55,842 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210
[2021-06-01 16:19:55,842 INFO  L87              Difference]: Start difference. First operand 62946 states and 271244 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-01 16:19:56,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:56,553 INFO  L93              Difference]: Finished difference Result 75546 states and 323932 transitions.
[2021-06-01 16:19:56,554 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2021-06-01 16:19:56,554 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-01 16:19:56,554 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:19:56,736 INFO  L225             Difference]: With dead ends: 75546
[2021-06-01 16:19:56,737 INFO  L226             Difference]: Without dead ends: 67482
[2021-06-01 16:19:56,737 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 314.0ms TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600
[2021-06-01 16:19:57,376 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 67482 states.
[2021-06-01 16:19:58,466 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 67482 to 59866.
[2021-06-01 16:19:58,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59866 states, 59865 states have (on average 4.312369498037251) internal successors, (258160), 59865 states have internal predecessors, (258160), 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-01 16:19:58,748 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59866 states to 59866 states and 258160 transitions.
[2021-06-01 16:19:58,748 INFO  L78                 Accepts]: Start accepts. Automaton has 59866 states and 258160 transitions. Word has length 84
[2021-06-01 16:19:58,748 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:19:58,748 INFO  L482      AbstractCegarLoop]: Abstraction has 59866 states and 258160 transitions.
[2021-06-01 16:19:58,749 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-01 16:19:58,749 INFO  L276                IsEmpty]: Start isEmpty. Operand 59866 states and 258160 transitions.
[2021-06-01 16:19:58,817 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 16:19:58,817 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:19:58,817 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-01 16:19:58,818 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-01 16:19:58,818 INFO  L430      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:19:58,818 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:19:58,818 INFO  L82        PathProgramCache]: Analyzing trace with hash -1166386011, now seen corresponding path program 3 times
[2021-06-01 16:19:58,818 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:19:58,818 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060388345]
[2021-06-01 16:19:58,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:19:58,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:19:58,943 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-01 16:19:58,943 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:19:58,943 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060388345]
[2021-06-01 16:19:58,944 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060388345] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:19:58,944 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:19:58,944 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:19:58,944 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592912442]
[2021-06-01 16:19:58,944 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:19:58,944 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:19:58,945 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:19:58,945 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:19:58,945 INFO  L87              Difference]: Start difference. First operand 59866 states and 258160 transitions. Second operand  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-01 16:19:59,914 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:19:59,915 INFO  L93              Difference]: Finished difference Result 87642 states and 372324 transitions.
[2021-06-01 16:19:59,915 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2021-06-01 16:19:59,915 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-01 16:19:59,915 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:00,167 INFO  L225             Difference]: With dead ends: 87642
[2021-06-01 16:20:00,168 INFO  L226             Difference]: Without dead ends: 72746
[2021-06-01 16:20:00,168 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 131.5ms TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240
[2021-06-01 16:20:00,420 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72746 states.
[2021-06-01 16:20:01,535 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72746 to 58816.
[2021-06-01 16:20:01,619 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 58816 states, 58815 states have (on average 4.266224602567372) internal successors, (250918), 58815 states have internal predecessors, (250918), 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-01 16:20:01,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 58816 states to 58816 states and 250918 transitions.
[2021-06-01 16:20:01,799 INFO  L78                 Accepts]: Start accepts. Automaton has 58816 states and 250918 transitions. Word has length 84
[2021-06-01 16:20:01,799 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:01,799 INFO  L482      AbstractCegarLoop]: Abstraction has 58816 states and 250918 transitions.
[2021-06-01 16:20:01,799 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 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-01 16:20:01,799 INFO  L276                IsEmpty]: Start isEmpty. Operand 58816 states and 250918 transitions.
[2021-06-01 16:20:01,868 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 16:20:01,868 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:01,869 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-01 16:20:01,869 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-01 16:20:01,869 INFO  L430      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:20:01,869 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:01,869 INFO  L82        PathProgramCache]: Analyzing trace with hash -85606259, now seen corresponding path program 1 times
[2021-06-01 16:20:01,873 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:01,873 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642610887]
[2021-06-01 16:20:01,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:01,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:01,964 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-01 16:20:01,964 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:01,964 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642610887]
[2021-06-01 16:20:01,964 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642610887] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:01,964 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:01,964 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:20:01,964 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143124770]
[2021-06-01 16:20:01,965 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:20:01,965 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:01,965 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:20:01,965 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:20:01,965 INFO  L87              Difference]: Start difference. First operand 58816 states and 250918 transitions. Second operand  has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-01 16:20:02,827 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:02,827 INFO  L93              Difference]: Finished difference Result 72324 states and 304830 transitions.
[2021-06-01 16:20:02,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 16:20:02,827 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-01 16:20:02,828 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:02,992 INFO  L225             Difference]: With dead ends: 72324
[2021-06-01 16:20:02,993 INFO  L226             Difference]: Without dead ends: 54628
[2021-06-01 16:20:02,993 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 56.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:20:03,198 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54628 states.
[2021-06-01 16:20:04,459 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54628 to 54628.
[2021-06-01 16:20:04,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54628 states, 54627 states have (on average 4.212019697219324) internal successors, (230090), 54627 states have internal predecessors, (230090), 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-01 16:20:04,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54628 states to 54628 states and 230090 transitions.
[2021-06-01 16:20:04,762 INFO  L78                 Accepts]: Start accepts. Automaton has 54628 states and 230090 transitions. Word has length 84
[2021-06-01 16:20:04,762 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:04,762 INFO  L482      AbstractCegarLoop]: Abstraction has 54628 states and 230090 transitions.
[2021-06-01 16:20:04,762 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 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-01 16:20:04,762 INFO  L276                IsEmpty]: Start isEmpty. Operand 54628 states and 230090 transitions.
[2021-06-01 16:20:04,835 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2021-06-01 16:20:04,835 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:04,835 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, 1]
[2021-06-01 16:20:04,835 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-01 16:20:04,835 INFO  L430      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:20:04,835 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:04,836 INFO  L82        PathProgramCache]: Analyzing trace with hash -1020391223, now seen corresponding path program 1 times
[2021-06-01 16:20:04,836 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:04,836 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441530466]
[2021-06-01 16:20:04,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:04,880 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:04,952 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-01 16:20:04,952 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:04,952 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441530466]
[2021-06-01 16:20:04,952 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441530466] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:04,953 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:04,953 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 16:20:04,953 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718866834]
[2021-06-01 16:20:04,953 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 16:20:04,953 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:04,953 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 16:20:04,953 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-01 16:20:04,953 INFO  L87              Difference]: Start difference. First operand 54628 states and 230090 transitions. Second operand  has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-01 16:20:05,475 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:05,475 INFO  L93              Difference]: Finished difference Result 56596 states and 232737 transitions.
[2021-06-01 16:20:05,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-01 16:20:05,476 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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 85
[2021-06-01 16:20:05,476 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:05,976 INFO  L225             Difference]: With dead ends: 56596
[2021-06-01 16:20:05,976 INFO  L226             Difference]: Without dead ends: 41092
[2021-06-01 16:20:05,976 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 68.1ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:20:06,240 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41092 states.
[2021-06-01 16:20:06,769 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41092 to 41092.
[2021-06-01 16:20:06,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 41092 states, 41091 states have (on average 4.074225499501107) internal successors, (167414), 41091 states have internal predecessors, (167414), 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-01 16:20:06,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41092 states to 41092 states and 167414 transitions.
[2021-06-01 16:20:06,938 INFO  L78                 Accepts]: Start accepts. Automaton has 41092 states and 167414 transitions. Word has length 85
[2021-06-01 16:20:06,938 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:06,938 INFO  L482      AbstractCegarLoop]: Abstraction has 41092 states and 167414 transitions.
[2021-06-01 16:20:06,939 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 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-01 16:20:06,939 INFO  L276                IsEmpty]: Start isEmpty. Operand 41092 states and 167414 transitions.
[2021-06-01 16:20:06,990 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2021-06-01 16:20:06,990 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:06,990 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, 1, 1, 1]
[2021-06-01 16:20:06,991 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-06-01 16:20:06,991 INFO  L430      AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:20:06,991 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:06,991 INFO  L82        PathProgramCache]: Analyzing trace with hash 958724974, now seen corresponding path program 1 times
[2021-06-01 16:20:06,991 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:06,991 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180792342]
[2021-06-01 16:20:06,991 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:07,007 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:07,048 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-01 16:20:07,048 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:07,048 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180792342]
[2021-06-01 16:20:07,048 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180792342] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:07,049 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:07,049 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:20:07,049 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241573033]
[2021-06-01 16:20:07,049 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:20:07,049 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:07,049 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:20:07,049 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:20:07,049 INFO  L87              Difference]: Start difference. First operand 41092 states and 167414 transitions. Second operand  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-01 16:20:07,752 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:07,752 INFO  L93              Difference]: Finished difference Result 67014 states and 269984 transitions.
[2021-06-01 16:20:07,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 16:20:07,752 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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 87
[2021-06-01 16:20:07,752 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:07,855 INFO  L225             Difference]: With dead ends: 67014
[2021-06-01 16:20:07,856 INFO  L226             Difference]: Without dead ends: 42604
[2021-06-01 16:20:07,856 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 63.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:20:07,981 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42604 states.
[2021-06-01 16:20:08,807 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42604 to 39580.
[2021-06-01 16:20:08,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39580 states, 39579 states have (on average 3.985750018949443) internal successors, (157752), 39579 states have internal predecessors, (157752), 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-01 16:20:08,982 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39580 states to 39580 states and 157752 transitions.
[2021-06-01 16:20:08,982 INFO  L78                 Accepts]: Start accepts. Automaton has 39580 states and 157752 transitions. Word has length 87
[2021-06-01 16:20:08,982 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:08,982 INFO  L482      AbstractCegarLoop]: Abstraction has 39580 states and 157752 transitions.
[2021-06-01 16:20:08,982 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-01 16:20:08,983 INFO  L276                IsEmpty]: Start isEmpty. Operand 39580 states and 157752 transitions.
[2021-06-01 16:20:09,036 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 89
[2021-06-01 16:20:09,037 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:09,037 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, 1, 1, 1, 1]
[2021-06-01 16:20:09,037 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-06-01 16:20:09,037 INFO  L430      AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:20:09,037 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:09,037 INFO  L82        PathProgramCache]: Analyzing trace with hash -1348750420, now seen corresponding path program 1 times
[2021-06-01 16:20:09,037 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:09,037 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788703239]
[2021-06-01 16:20:09,037 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:09,056 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:09,103 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-01 16:20:09,104 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:09,104 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788703239]
[2021-06-01 16:20:09,104 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788703239] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:09,104 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:09,104 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-01 16:20:09,104 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091773491]
[2021-06-01 16:20:09,104 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-01 16:20:09,104 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:09,104 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-01 16:20:09,104 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-01 16:20:09,105 INFO  L87              Difference]: Start difference. First operand 39580 states and 157752 transitions. Second operand  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-01 16:20:09,349 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:09,349 INFO  L93              Difference]: Finished difference Result 34720 states and 135252 transitions.
[2021-06-01 16:20:09,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-01 16:20:09,350 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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 88
[2021-06-01 16:20:09,350 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:09,409 INFO  L225             Difference]: With dead ends: 34720
[2021-06-01 16:20:09,409 INFO  L226             Difference]: Without dead ends: 25180
[2021-06-01 16:20:09,410 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 78.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2021-06-01 16:20:09,475 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25180 states.
[2021-06-01 16:20:09,780 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25180 to 23680.
[2021-06-01 16:20:10,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23680 states, 23679 states have (on average 3.858059884285654) internal successors, (91355), 23679 states have internal predecessors, (91355), 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-01 16:20:10,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23680 states to 23680 states and 91355 transitions.
[2021-06-01 16:20:10,199 INFO  L78                 Accepts]: Start accepts. Automaton has 23680 states and 91355 transitions. Word has length 88
[2021-06-01 16:20:10,199 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:10,199 INFO  L482      AbstractCegarLoop]: Abstraction has 23680 states and 91355 transitions.
[2021-06-01 16:20:10,200 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 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-01 16:20:10,200 INFO  L276                IsEmpty]: Start isEmpty. Operand 23680 states and 91355 transitions.
[2021-06-01 16:20:10,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2021-06-01 16:20:10,233 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:10,233 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:20:10,233 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2021-06-01 16:20:10,233 INFO  L430      AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:20:10,233 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:10,233 INFO  L82        PathProgramCache]: Analyzing trace with hash -35164448, now seen corresponding path program 1 times
[2021-06-01 16:20:10,234 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:10,234 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739223139]
[2021-06-01 16:20:10,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:10,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:10,306 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-01 16:20:10,307 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:10,307 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739223139]
[2021-06-01 16:20:10,307 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739223139] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:10,307 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:10,307 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-01 16:20:10,307 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133459191]
[2021-06-01 16:20:10,307 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-01 16:20:10,307 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:10,308 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-01 16:20:10,308 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2021-06-01 16:20:10,308 INFO  L87              Difference]: Start difference. First operand 23680 states and 91355 transitions. Second operand  has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-01 16:20:10,543 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:10,543 INFO  L93              Difference]: Finished difference Result 20224 states and 77450 transitions.
[2021-06-01 16:20:10,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2021-06-01 16:20:10,543 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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 92
[2021-06-01 16:20:10,544 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:10,570 INFO  L225             Difference]: With dead ends: 20224
[2021-06-01 16:20:10,570 INFO  L226             Difference]: Without dead ends: 11890
[2021-06-01 16:20:10,570 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 100.0ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272
[2021-06-01 16:20:10,595 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11890 states.
[2021-06-01 16:20:10,719 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11890 to 9890.
[2021-06-01 16:20:10,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9890 states, 9889 states have (on average 3.7816766103751642) internal successors, (37397), 9889 states have internal predecessors, (37397), 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-01 16:20:10,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9890 states to 9890 states and 37397 transitions.
[2021-06-01 16:20:10,757 INFO  L78                 Accepts]: Start accepts. Automaton has 9890 states and 37397 transitions. Word has length 92
[2021-06-01 16:20:10,758 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:10,758 INFO  L482      AbstractCegarLoop]: Abstraction has 9890 states and 37397 transitions.
[2021-06-01 16:20:10,758 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 9 states have internal predecessors, (92), 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-01 16:20:10,758 INFO  L276                IsEmpty]: Start isEmpty. Operand 9890 states and 37397 transitions.
[2021-06-01 16:20:10,773 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2021-06-01 16:20:10,773 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:10,774 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:20:10,774 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2021-06-01 16:20:10,774 INFO  L430      AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:20:10,774 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:10,774 INFO  L82        PathProgramCache]: Analyzing trace with hash -1279350659, now seen corresponding path program 1 times
[2021-06-01 16:20:10,774 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:10,774 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188852238]
[2021-06-01 16:20:10,774 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:10,800 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:10,847 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-01 16:20:10,847 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:10,847 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188852238]
[2021-06-01 16:20:10,847 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188852238] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:10,848 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:10,848 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 16:20:10,848 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301718178]
[2021-06-01 16:20:10,848 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 16:20:10,848 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:10,848 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 16:20:10,848 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-01 16:20:10,849 INFO  L87              Difference]: Start difference. First operand 9890 states and 37397 transitions. Second operand  has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-01 16:20:10,951 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:10,951 INFO  L93              Difference]: Finished difference Result 14108 states and 53577 transitions.
[2021-06-01 16:20:10,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-06-01 16:20:10,951 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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 97
[2021-06-01 16:20:10,952 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:10,962 INFO  L225             Difference]: With dead ends: 14108
[2021-06-01 16:20:10,962 INFO  L226             Difference]: Without dead ends: 5265
[2021-06-01 16:20:10,962 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.6ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:20:10,972 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5265 states.
[2021-06-01 16:20:11,017 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5265 to 5265.
[2021-06-01 16:20:11,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5265 states, 5264 states have (on average 3.7237841945288754) internal successors, (19602), 5264 states have internal predecessors, (19602), 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-01 16:20:11,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 19602 transitions.
[2021-06-01 16:20:11,032 INFO  L78                 Accepts]: Start accepts. Automaton has 5265 states and 19602 transitions. Word has length 97
[2021-06-01 16:20:11,032 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:11,032 INFO  L482      AbstractCegarLoop]: Abstraction has 5265 states and 19602 transitions.
[2021-06-01 16:20:11,033 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-01 16:20:11,033 INFO  L276                IsEmpty]: Start isEmpty. Operand 5265 states and 19602 transitions.
[2021-06-01 16:20:11,039 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2021-06-01 16:20:11,039 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:11,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 16:20:11,039 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2021-06-01 16:20:11,039 INFO  L430      AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:20:11,040 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:11,040 INFO  L82        PathProgramCache]: Analyzing trace with hash 2127511041, now seen corresponding path program 2 times
[2021-06-01 16:20:11,040 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:11,040 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996086626]
[2021-06-01 16:20:11,040 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:11,062 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 16:20:11,063 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 16:20:11,087 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 16:20:11,088 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 16:20:11,130 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-01 16:20:11,130 INFO  L655         BasicCegarLoop]: Counterexample might be feasible
[2021-06-01 16:20:11,130 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2021-06-01 16:20:11,130 INFO  L301   ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3)
[2021-06-01 16:20:11,131 INFO  L247   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-01 16:20:11,253 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.06 04:20:11 BasicIcfg
[2021-06-01 16:20:11,253 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-01 16:20:11,253 INFO  L168              Benchmark]: Toolchain (without parser) took 100345.23 ms. Allocated memory was 339.7 MB in the beginning and 15.4 GB in the end (delta: 15.0 GB). Free memory was 301.9 MB in the beginning and 12.5 GB in the end (delta: -12.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.0 GB.
[2021-06-01 16:20:11,253 INFO  L168              Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 339.7 MB. Free memory is still 319.9 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-01 16:20:11,253 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 489.16 ms. Allocated memory is still 339.7 MB. Free memory was 301.8 MB in the beginning and 297.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB.
[2021-06-01 16:20:11,253 INFO  L168              Benchmark]: Boogie Procedure Inliner took 33.01 ms. Allocated memory is still 339.7 MB. Free memory was 297.0 MB in the beginning and 293.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-06-01 16:20:11,254 INFO  L168              Benchmark]: Boogie Preprocessor took 33.48 ms. Allocated memory is still 339.7 MB. Free memory was 293.8 MB in the beginning and 291.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 16:20:11,254 INFO  L168              Benchmark]: RCFGBuilder took 1413.55 ms. Allocated memory is still 339.7 MB. Free memory was 291.7 MB in the beginning and 229.4 MB in the end (delta: 62.3 MB). Peak memory consumption was 142.6 MB. Max. memory is 16.0 GB.
[2021-06-01 16:20:11,254 INFO  L168              Benchmark]: TraceAbstraction took 98371.17 ms. Allocated memory was 339.7 MB in the beginning and 15.4 GB in the end (delta: 15.0 GB). Free memory was 228.4 MB in the beginning and 12.5 GB in the end (delta: -12.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 16.0 GB.
[2021-06-01 16:20:11,254 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.13 ms. Allocated memory is still 339.7 MB. Free memory is still 319.9 MB. There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 489.16 ms. Allocated memory is still 339.7 MB. Free memory was 301.8 MB in the beginning and 297.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 33.01 ms. Allocated memory is still 339.7 MB. Free memory was 297.0 MB in the beginning and 293.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 33.48 ms. Allocated memory is still 339.7 MB. Free memory was 293.8 MB in the beginning and 291.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 1413.55 ms. Allocated memory is still 339.7 MB. Free memory was 291.7 MB in the beginning and 229.4 MB in the end (delta: 62.3 MB). Peak memory consumption was 142.6 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 98371.17 ms. Allocated memory was 339.7 MB in the beginning and 15.4 GB in the end (delta: 15.0 GB). Free memory was 228.4 MB in the beginning and 12.5 GB in the end (delta: -12.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 16.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 18]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - CounterExampleResult [Line: 18]: 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_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0]
[L714]               0  int __unbuffered_p3_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0]
[L716]               0  int a = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0]
[L717]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0]
[L718]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L720]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L722]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L723]               0  _Bool y$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0]
[L730]               0  _Bool y$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0]
[L731]               0  _Bool y$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0]
[L732]               0  _Bool y$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0]
[L733]               0  _Bool y$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0]
[L734]               0  _Bool y$r_buff1_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0]
[L735]               0  _Bool y$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0]
[L736]               0  int *y$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}]
[L737]               0  int y$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0]
[L738]               0  _Bool y$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0]
[L739]               0  int y$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0]
[L740]               0  _Bool y$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L742]               0  int z = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L743]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L744]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L841]               0  pthread_t t1433;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L842]  FCALL, FORK  0  pthread_create(&t1433, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L843]               0  pthread_t t1434;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L844]  FCALL, FORK  0  pthread_create(&t1434, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L845]               0  pthread_t t1435;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L846]  FCALL, FORK  0  pthread_create(&t1435, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L847]               0  pthread_t t1436;
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L783]               3  y$w_buff1 = y$w_buff0
[L784]               3  y$w_buff0 = 2
[L785]               3  y$w_buff1_used = y$w_buff0_used
[L786]               3  y$w_buff0_used = (_Bool)1
[L18]   COND FALSE   3  !(!expression)
[L788]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L789]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L790]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L791]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L792]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L793]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L796]               3  __unbuffered_p2_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L848]  FCALL, FORK  0  pthread_create(&t1436, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0]
[L813]               4  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L816]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L819]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L819]  EXPR         4  y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y
[L819]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L819]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L820]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L820]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L821]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L821]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L822]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L822]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L823]  EXPR         4  y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L823]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L826]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L748]               1  a = 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L751]               1  x = 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L763]               2  x = 2
        VAL             [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L766]               2  y = 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L769]  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)
[L769]  EXPR         2  y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L769]  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)
[L769]               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)
[L770]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L770]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L771]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L771]               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
[L772]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L772]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L773]  EXPR         2  y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L773]               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
[L776]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L799]  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)
[L799]               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)
[L800]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L800]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L801]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L801]               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
[L802]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L802]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L803]  EXPR         3  y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L803]               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
[L806]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L756]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L850]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L3]    COND FALSE   0  !(!cond)
        VAL             [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L854]  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)
[L854]  EXPR         0  y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L854]  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)
[L854]               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)
[L855]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L855]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L856]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L856]               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
[L857]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L857]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L858]  EXPR         0  y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L858]               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
[L861]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L862]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L863]               0  y$flush_delayed = weak$$choice2
[L864]               0  y$mem_tmp = y
[L865]  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)
[L865]               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)
[L866]  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))
[L866]               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))
[L867]  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))
[L867]               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))
[L868]  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))
[L868]               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))
[L869]  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))
[L869]               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))
[L870]  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))
[L870]               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))
[L871]  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))
[L871]               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))
[L872]               0  main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0)
[L873]  EXPR         0  y$flush_delayed ? y$mem_tmp : y
[L873]               0  y = y$flush_delayed ? y$mem_tmp : y
[L874]               0  y$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L18]   COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]
[L18]                0  reach_error()
        VAL             [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1]

  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2 with 1 thread instances
    CFG has 9 procedures, 161 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18221.4ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 863.8ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17355.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=120940occurred 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: P2Thread1of1ForFork2 with 1 thread instances
    CFG has 9 procedures, 161 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 18625.2ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 144.6ms, AutomataDifference: 1314.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16647.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 113 SDtfs, 50 SDslu, 84 SDs, 0 SdLazy, 11 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=120940occurred 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: 5.7ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 44.6ms SsaConstructionTime, 59.0ms SatisfiabilityAnalysisTime, 120.1ms InterpolantComputationTime, 59 NumberOfCodeBlocks, 59 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 114 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 9 procedures, 161 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 61320.0ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 1091.4ms, AutomataDifference: 16335.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15819.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3297 SDtfs, 5547 SDslu, 12865 SDs, 0 SdLazy, 1667 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1613.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 2599.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=120940occurred in iteration=0, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 25706.1ms AutomataMinimizationTime, 17 MinimizatonAttempts, 57736 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 41.8ms SsaConstructionTime, 421.6ms SatisfiabilityAnalysisTime, 1682.7ms InterpolantComputationTime, 1535 NumberOfCodeBlocks, 1535 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1421 ConstructedInterpolants, 0 QuantifiedInterpolants, 8124 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...