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


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


This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788
[2021-06-01 16:19:45,756 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-06-01 16:19:45,758 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-01 16:19:45,781 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-01 16:19:45,781 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-01 16:19:45,782 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-01 16:19:45,783 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-01 16:19:45,785 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-01 16:19:45,787 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-01 16:19:45,787 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-01 16:19:45,788 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-06-01 16:19:45,789 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-01 16:19:45,790 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-01 16:19:45,791 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-01 16:19:45,792 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-01 16:19:45,793 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-01 16:19:45,793 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-01 16:19:45,794 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-01 16:19:45,796 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-01 16:19:45,797 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-01 16:19:45,799 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-01 16:19:45,800 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-01 16:19:45,801 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-06-01 16:19:45,801 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-01 16:19:45,804 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-01 16:19:45,804 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-01 16:19:45,804 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-01 16:19:45,805 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-01 16:19:45,805 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-01 16:19:45,806 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-01 16:19:45,806 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-01 16:19:45,807 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-01 16:19:45,807 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-01 16:19:45,808 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-01 16:19:45,809 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-01 16:19:45,809 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-01 16:19:45,810 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-01 16:19:45,810 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-01 16:19:45,810 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-01 16:19:45,811 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-01 16:19:45,811 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-06-01 16:19:45,812 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:19:45,835 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-06-01 16:19:45,835 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-01 16:19:45,835 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-01 16:19:45,836 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-01 16:19:45,837 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-01 16:19:45,837 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-06-01 16:19:45,837 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-06-01 16:19:45,837 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-01 16:19:45,837 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-06-01 16:19:45,838 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-06-01 16:19:45,838 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-06-01 16:19:45,838 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-06-01 16:19:45,838 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-06-01 16:19:45,838 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-01 16:19:45,839 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-06-01 16:19:45,839 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-06-01 16:19:45,839 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-06-01 16:19:45,839 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-06-01 16:19:45,839 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-06-01 16:19:45,840 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-01 16:19:45,840 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-06-01 16:19:45,840 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2021-06-01 16:19:45,843 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-06-01 16:19:45,843 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 16:19:45,844 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-01 16:19:45,844 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-06-01 16:19:45,844 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-01 16:19:45,844 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-06-01 16:19:45,845 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-01 16:19:45,845 INFO  L138        SettingsManager]:  * Large block encoding in concurrent analysis=OFF
[2021-06-01 16:19:45,845 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-01 16:19:45,845 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:19:46,159 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-01 16:19:46,188 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-01 16:19:46,190 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-01 16:19:46,191 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-06-01 16:19:46,193 INFO  L275        PluginConnector]: CDTParser initialized
[2021-06-01 16:19:46,194 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i
[2021-06-01 16:19:46,254 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93765fa0e/6987616778c14dd88aca48ebe4c3fdc7/FLAG11b17e54f
[2021-06-01 16:19:46,801 INFO  L306              CDTParser]: Found 1 translation units.
[2021-06-01 16:19:46,802 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_rmo.opt.i
[2021-06-01 16:19:46,827 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93765fa0e/6987616778c14dd88aca48ebe4c3fdc7/FLAG11b17e54f
[2021-06-01 16:19:47,086 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93765fa0e/6987616778c14dd88aca48ebe4c3fdc7
[2021-06-01 16:19:47,089 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-01 16:19:47,090 INFO  L131        ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-01 16:19:47,094 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-01 16:19:47,094 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-01 16:19:47,097 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-01 16:19:47,098 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:19:47" (1/1) ...
[2021-06-01 16:19:47,100 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61289df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47, skipping insertion in model container
[2021-06-01 16:19:47,100 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 04:19:47" (1/1) ...
[2021-06-01 16:19:47,106 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-06-01 16:19:47,157 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-06-01 16:19:47,346 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/mix055_rmo.opt.i[948,961]
[2021-06-01 16:19:47,569 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-01 16:19:47,576 INFO  L203         MainTranslator]: Completed pre-run
[2021-06-01 16:19:47,585 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/mix055_rmo.opt.i[948,961]
[2021-06-01 16:19:47,642 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-06-01 16:19:47,708 INFO  L208         MainTranslator]: Completed translation
[2021-06-01 16:19:47,709 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47 WrapperNode
[2021-06-01 16:19:47,709 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-01 16:19:47,712 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-01 16:19:47,713 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-01 16:19:47,713 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-01 16:19:47,719 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:19:47" (1/1) ...
[2021-06-01 16:19:47,752 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:19:47" (1/1) ...
[2021-06-01 16:19:47,792 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-01 16:19:47,792 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-01 16:19:47,792 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-01 16:19:47,792 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-06-01 16:19:47,802 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47" (1/1) ...
[2021-06-01 16:19:47,802 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47" (1/1) ...
[2021-06-01 16:19:47,805 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47" (1/1) ...
[2021-06-01 16:19:47,805 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47" (1/1) ...
[2021-06-01 16:19:47,825 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47" (1/1) ...
[2021-06-01 16:19:47,831 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47" (1/1) ...
[2021-06-01 16:19:47,833 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47" (1/1) ...
[2021-06-01 16:19:47,838 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-01 16:19:47,838 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-01 16:19:47,839 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-06-01 16:19:47,839 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-06-01 16:19:47,839 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47" (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:19:47,931 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-06-01 16:19:47,932 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-01 16:19:47,932 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-01 16:19:47,932 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-01 16:19:47,933 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-06-01 16:19:47,934 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-06-01 16:19:47,934 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-06-01 16:19:47,934 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-06-01 16:19:47,935 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-06-01 16:19:47,935 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-06-01 16:19:47,935 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2021-06-01 16:19:47,935 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2021-06-01 16:19:47,935 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-01 16:19:47,935 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-01 16:19:47,935 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-01 16:19:47,935 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-01 16:19:47,937 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:19:49,480 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-01 16:19:49,480 INFO  L299             CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-01 16:19:49,481 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:19:49 BoogieIcfgContainer
[2021-06-01 16:19:49,481 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-01 16:19:49,483 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-01 16:19:49,483 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-06-01 16:19:49,485 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-06-01 16:19:49,485 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.06 04:19:47" (1/3) ...
[2021-06-01 16:19:49,486 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b971c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:19:49, skipping insertion in model container
[2021-06-01 16:19:49,486 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 04:19:47" (2/3) ...
[2021-06-01 16:19:49,486 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b971c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 04:19:49, skipping insertion in model container
[2021-06-01 16:19:49,486 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 04:19:49" (3/3) ...
[2021-06-01 16:19:49,487 INFO  L111   eAbstractionObserver]: Analyzing ICFG mix055_rmo.opt.i
[2021-06-01 16:19:49,492 WARN  L148   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-01 16:19:49,493 INFO  L214   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-01 16:19:49,493 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-01 16:19:49,493 INFO  L471   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-01 16:19:49,522 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,523 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,523 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,523 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,523 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,523 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,523 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,523 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,524 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,524 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,524 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,524 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,524 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,524 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,525 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,525 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,525 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,525 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,525 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,525 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,525 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,525 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,526 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,526 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,526 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,526 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,526 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,526 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,526 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,526 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,527 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,527 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,527 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,527 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,527 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,527 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,527 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,527 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,527 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,528 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,528 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,528 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,528 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,528 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,528 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,528 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,529 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,529 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,529 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,529 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,530 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,530 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,530 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,530 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,530 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,530 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,530 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,530 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,530 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,531 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,531 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,531 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,531 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,531 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,531 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,531 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,532 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,532 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,532 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,532 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,532 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,532 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,532 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,532 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,533 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,533 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,533 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,533 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,533 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,533 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,534 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,534 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,534 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,534 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,536 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,536 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,536 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,538 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,538 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,538 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,538 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,538 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,539 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,539 WARN  L313   ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,539 WARN  L313   ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,541 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,541 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,541 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,542 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,543 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,543 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,543 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 16:19:49,544 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-01 16:19:49,562 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 16:19:49,578 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:19:49,578 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 16:19:49,578 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:19:49,578 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:19:49,578 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:19:49,578 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 16:19:49,578 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:19:49,578 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P3========
[2021-06-01 16:19:49,588 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 125 transitions, 270 flow
[2021-06-01 16:20:08,101 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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,246 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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,028 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 16:20:09,029 INFO  L301   ceAbstractionStarter]: Result for error location P3 was SAFE (1/3)
[2021-06-01 16:20:09,031 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2021-06-01 16:20:09,068 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:20:09,068 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 16:20:09,069 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:20:09,069 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:20:09,069 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:20:09,069 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 16:20:09,069 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:20:09,069 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-01 16:20:09,072 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 125 transitions, 270 flow
[2021-06-01 16:20:26,629 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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:26,773 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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:27,056 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 79
[2021-06-01 16:20:27,056 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:27,057 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:20:27,057 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:20:27,062 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:27,062 INFO  L82        PathProgramCache]: Analyzing trace with hash 414741433, now seen corresponding path program 1 times
[2021-06-01 16:20:27,083 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:27,083 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127705842]
[2021-06-01 16:20:27,084 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:27,367 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:27,592 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:27,592 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:27,592 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127705842]
[2021-06-01 16:20:27,594 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127705842] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:27,594 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:27,594 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:20:27,595 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889004979]
[2021-06-01 16:20:27,598 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:20:27,598 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:27,609 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:20:27,610 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:20:27,740 INFO  L87              Difference]: Start difference. First operand  has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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:20:29,716 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:29,716 INFO  L93              Difference]: Finished difference Result 150635 states and 662402 transitions.
[2021-06-01 16:20:29,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 16:20:29,718 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:20:29,719 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:30,123 INFO  L225             Difference]: With dead ends: 150635
[2021-06-01 16:20:30,123 INFO  L226             Difference]: Without dead ends: 53507
[2021-06-01 16:20:30,124 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 94.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:20:30,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53507 states.
[2021-06-01 16:20:32,503 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 53507.
[2021-06-01 16:20:32,578 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53507 states, 53505 states have (on average 4.336473226801234) internal successors, (232023), 53506 states have internal predecessors, (232023), 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:32,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53507 states to 53507 states and 232023 transitions.
[2021-06-01 16:20:32,938 INFO  L78                 Accepts]: Start accepts. Automaton has 53507 states and 232023 transitions. Word has length 78
[2021-06-01 16:20:32,939 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:32,939 INFO  L482      AbstractCegarLoop]: Abstraction has 53507 states and 232023 transitions.
[2021-06-01 16:20:32,940 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:20:32,940 INFO  L276                IsEmpty]: Start isEmpty. Operand 53507 states and 232023 transitions.
[2021-06-01 16:20:33,013 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2021-06-01 16:20:33,014 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:33,014 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:20:33,014 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-01 16:20:33,014 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:20:33,015 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:33,015 INFO  L82        PathProgramCache]: Analyzing trace with hash -150882152, now seen corresponding path program 1 times
[2021-06-01 16:20:33,015 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:33,016 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711692432]
[2021-06-01 16:20:33,016 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:33,065 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:33,253 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:33,253 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:33,253 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711692432]
[2021-06-01 16:20:33,254 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711692432] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:33,254 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:33,254 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:20:33,254 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620722820]
[2021-06-01 16:20:33,256 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:20:33,256 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:33,257 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:20:33,257 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:20:33,258 INFO  L87              Difference]: Start difference. First operand 53507 states and 232023 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:20:34,347 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:34,348 INFO  L93              Difference]: Finished difference Result 62021 states and 266446 transitions.
[2021-06-01 16:20:34,348 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-06-01 16:20:34,349 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:20:34,349 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:34,587 INFO  L225             Difference]: With dead ends: 62021
[2021-06-01 16:20:34,588 INFO  L226             Difference]: Without dead ends: 49637
[2021-06-01 16:20:34,588 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 224.8ms TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306
[2021-06-01 16:20:35,144 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49637 states.
[2021-06-01 16:20:36,183 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49637 to 49637.
[2021-06-01 16:20:36,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49637 states, 49635 states have (on average 4.310123904502871) internal successors, (213933), 49636 states have internal predecessors, (213933), 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:36,729 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49637 states to 49637 states and 213933 transitions.
[2021-06-01 16:20:36,729 INFO  L78                 Accepts]: Start accepts. Automaton has 49637 states and 213933 transitions. Word has length 80
[2021-06-01 16:20:36,730 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:36,730 INFO  L482      AbstractCegarLoop]: Abstraction has 49637 states and 213933 transitions.
[2021-06-01 16:20:36,730 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:20:36,730 INFO  L276                IsEmpty]: Start isEmpty. Operand 49637 states and 213933 transitions.
[2021-06-01 16:20:36,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2021-06-01 16:20:36,874 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:36,874 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:20:36,876 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-01 16:20:36,876 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:20:36,876 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:36,876 INFO  L82        PathProgramCache]: Analyzing trace with hash 1557061825, now seen corresponding path program 1 times
[2021-06-01 16:20:36,877 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:36,877 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569264439]
[2021-06-01 16:20:36,877 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:36,924 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:37,143 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:37,144 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:37,144 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569264439]
[2021-06-01 16:20:37,144 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569264439] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:37,144 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:37,145 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2021-06-01 16:20:37,145 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203437749]
[2021-06-01 16:20:37,145 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 10 states
[2021-06-01 16:20:37,145 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:37,146 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2021-06-01 16:20:37,146 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2021-06-01 16:20:37,146 INFO  L87              Difference]: Start difference. First operand 49637 states and 213933 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:20:37,872 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:37,872 INFO  L93              Difference]: Finished difference Result 56861 states and 243186 transitions.
[2021-06-01 16:20:37,873 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2021-06-01 16:20:37,873 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:20:37,873 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:38,099 INFO  L225             Difference]: With dead ends: 56861
[2021-06-01 16:20:38,099 INFO  L226             Difference]: Without dead ends: 49121
[2021-06-01 16:20:38,100 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 275.8ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342
[2021-06-01 16:20:38,741 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49121 states.
[2021-06-01 16:20:39,617 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49121 to 49121.
[2021-06-01 16:20:39,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49121 states, 49119 states have (on average 4.301044402369755) internal successors, (211263), 49120 states have internal predecessors, (211263), 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:39,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49121 states to 49121 states and 211263 transitions.
[2021-06-01 16:20:39,856 INFO  L78                 Accepts]: Start accepts. Automaton has 49121 states and 211263 transitions. Word has length 83
[2021-06-01 16:20:39,856 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:39,856 INFO  L482      AbstractCegarLoop]: Abstraction has 49121 states and 211263 transitions.
[2021-06-01 16:20:39,857 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:20:39,857 INFO  L276                IsEmpty]: Start isEmpty. Operand 49121 states and 211263 transitions.
[2021-06-01 16:20:39,939 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 16:20:39,939 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:39,939 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:39,940 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-01 16:20:39,940 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:20:39,940 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:39,941 INFO  L82        PathProgramCache]: Analyzing trace with hash -1711416520, now seen corresponding path program 1 times
[2021-06-01 16:20:39,941 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:39,941 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331397781]
[2021-06-01 16:20:39,941 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:40,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:40,264 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:40,264 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:40,264 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331397781]
[2021-06-01 16:20:40,264 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331397781] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:40,264 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:40,264 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-01 16:20:40,265 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064157408]
[2021-06-01 16:20:40,265 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-01 16:20:40,265 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:40,266 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-01 16:20:40,266 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132
[2021-06-01 16:20:40,266 INFO  L87              Difference]: Start difference. First operand 49121 states and 211263 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:20:41,150 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:41,151 INFO  L93              Difference]: Finished difference Result 53249 states and 226603 transitions.
[2021-06-01 16:20:41,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2021-06-01 16:20:41,152 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:20:41,152 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:41,338 INFO  L225             Difference]: With dead ends: 53249
[2021-06-01 16:20:41,338 INFO  L226             Difference]: Without dead ends: 47057
[2021-06-01 16:20:41,338 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 248.3ms TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306
[2021-06-01 16:20:41,593 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47057 states.
[2021-06-01 16:20:42,814 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47057 to 47057.
[2021-06-01 16:20:42,894 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47057 states, 47055 states have (on average 4.273700988205292) internal successors, (201099), 47056 states have internal predecessors, (201099), 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:43,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47057 states to 47057 states and 201099 transitions.
[2021-06-01 16:20:43,460 INFO  L78                 Accepts]: Start accepts. Automaton has 47057 states and 201099 transitions. Word has length 84
[2021-06-01 16:20:43,460 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:43,460 INFO  L482      AbstractCegarLoop]: Abstraction has 47057 states and 201099 transitions.
[2021-06-01 16:20:43,460 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:20:43,460 INFO  L276                IsEmpty]: Start isEmpty. Operand 47057 states and 201099 transitions.
[2021-06-01 16:20:43,529 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2021-06-01 16:20:43,530 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:43,530 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:43,530 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-01 16:20:43,530 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:20:43,531 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:43,531 INFO  L82        PathProgramCache]: Analyzing trace with hash -1328186757, now seen corresponding path program 1 times
[2021-06-01 16:20:43,531 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:43,531 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621409997]
[2021-06-01 16:20:43,531 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:43,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:43,619 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:43,619 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:43,620 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621409997]
[2021-06-01 16:20:43,620 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621409997] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:43,620 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:43,620 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:20:43,620 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402414520]
[2021-06-01 16:20:43,620 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:20:43,621 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:43,621 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:20:43,621 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:20:43,621 INFO  L87              Difference]: Start difference. First operand 47057 states and 201099 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:44,022 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:44,023 INFO  L93              Difference]: Finished difference Result 57629 states and 243667 transitions.
[2021-06-01 16:20:44,023 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 16:20:44,023 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:44,024 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:44,148 INFO  L225             Difference]: With dead ends: 57629
[2021-06-01 16:20:44,148 INFO  L226             Difference]: Without dead ends: 43517
[2021-06-01 16:20:44,148 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 84.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:20:44,833 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 43517 states.
[2021-06-01 16:20:45,424 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 43517 to 43517.
[2021-06-01 16:20:45,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 43517 states, 43515 states have (on average 4.2173733195449845) internal successors, (183519), 43516 states have internal predecessors, (183519), 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:46,008 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 43517 states to 43517 states and 183519 transitions.
[2021-06-01 16:20:46,008 INFO  L78                 Accepts]: Start accepts. Automaton has 43517 states and 183519 transitions. Word has length 84
[2021-06-01 16:20:46,008 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:46,008 INFO  L482      AbstractCegarLoop]: Abstraction has 43517 states and 183519 transitions.
[2021-06-01 16:20:46,008 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:46,008 INFO  L276                IsEmpty]: Start isEmpty. Operand 43517 states and 183519 transitions.
[2021-06-01 16:20:46,068 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2021-06-01 16:20:46,069 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:46,069 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:46,069 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-01 16:20:46,069 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:20:46,070 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:46,070 INFO  L82        PathProgramCache]: Analyzing trace with hash -276744953, now seen corresponding path program 1 times
[2021-06-01 16:20:46,070 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:46,070 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812855710]
[2021-06-01 16:20:46,070 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:46,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:46,158 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:46,158 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:46,159 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812855710]
[2021-06-01 16:20:46,159 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812855710] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:46,159 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:46,159 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 16:20:46,159 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270225937]
[2021-06-01 16:20:46,160 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 16:20:46,160 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:46,160 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 16:20:46,160 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-01 16:20:46,161 INFO  L87              Difference]: Start difference. First operand 43517 states and 183519 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:46,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:46,511 INFO  L93              Difference]: Finished difference Result 45017 states and 185887 transitions.
[2021-06-01 16:20:46,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-06-01 16:20:46,512 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:46,512 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:46,600 INFO  L225             Difference]: With dead ends: 45017
[2021-06-01 16:20:46,600 INFO  L226             Difference]: Without dead ends: 32825
[2021-06-01 16:20:46,600 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 93.0ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:20:46,723 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32825 states.
[2021-06-01 16:20:47,604 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32825 to 32825.
[2021-06-01 16:20:47,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32825 states, 32823 states have (on average 4.08527556896079) internal successors, (134091), 32824 states have internal predecessors, (134091), 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:47,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32825 states to 32825 states and 134091 transitions.
[2021-06-01 16:20:47,760 INFO  L78                 Accepts]: Start accepts. Automaton has 32825 states and 134091 transitions. Word has length 85
[2021-06-01 16:20:47,760 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:47,761 INFO  L482      AbstractCegarLoop]: Abstraction has 32825 states and 134091 transitions.
[2021-06-01 16:20:47,761 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:47,761 INFO  L276                IsEmpty]: Start isEmpty. Operand 32825 states and 134091 transitions.
[2021-06-01 16:20:47,804 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2021-06-01 16:20:47,804 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:47,805 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:47,805 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-01 16:20:47,805 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:20:47,805 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:47,806 INFO  L82        PathProgramCache]: Analyzing trace with hash -1752105178, now seen corresponding path program 1 times
[2021-06-01 16:20:47,806 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:47,806 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017160877]
[2021-06-01 16:20:47,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:47,842 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:47,917 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:47,918 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:47,918 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017160877]
[2021-06-01 16:20:47,918 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017160877] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:47,918 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:47,918 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-01 16:20:47,918 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682107934]
[2021-06-01 16:20:47,918 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-01 16:20:47,918 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:47,919 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-01 16:20:47,919 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-01 16:20:47,919 INFO  L87              Difference]: Start difference. First operand 32825 states and 134091 transitions. Second operand  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:48,278 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:48,278 INFO  L93              Difference]: Finished difference Result 27767 states and 111219 transitions.
[2021-06-01 16:20:48,279 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-01 16:20:48,279 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:48,279 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:48,749 INFO  L225             Difference]: With dead ends: 27767
[2021-06-01 16:20:48,749 INFO  L226             Difference]: Without dead ends: 20567
[2021-06-01 16:20:48,750 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 104.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2021-06-01 16:20:48,859 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20567 states.
[2021-06-01 16:20:49,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20567 to 20567.
[2021-06-01 16:20:49,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20567 states, 20565 states have (on average 3.963676148796499) internal successors, (81513), 20566 states have internal predecessors, (81513), 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:49,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20567 states to 20567 states and 81513 transitions.
[2021-06-01 16:20:49,189 INFO  L78                 Accepts]: Start accepts. Automaton has 20567 states and 81513 transitions. Word has length 87
[2021-06-01 16:20:49,189 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:49,189 INFO  L482      AbstractCegarLoop]: Abstraction has 20567 states and 81513 transitions.
[2021-06-01 16:20:49,190 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 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:49,190 INFO  L276                IsEmpty]: Start isEmpty. Operand 20567 states and 81513 transitions.
[2021-06-01 16:20:49,219 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2021-06-01 16:20:49,219 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:49,219 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]
[2021-06-01 16:20:49,219 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-01 16:20:49,220 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:20:49,220 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:49,220 INFO  L82        PathProgramCache]: Analyzing trace with hash 496749480, now seen corresponding path program 1 times
[2021-06-01 16:20:49,220 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:49,220 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383052134]
[2021-06-01 16:20:49,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:49,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:49,310 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:49,311 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:49,311 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383052134]
[2021-06-01 16:20:49,311 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383052134] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:49,311 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:49,311 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 16:20:49,311 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110615203]
[2021-06-01 16:20:49,312 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 16:20:49,312 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:49,312 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 16:20:49,312 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-01 16:20:49,312 INFO  L87              Difference]: Start difference. First operand 20567 states and 81513 transitions. Second operand  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:49,534 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:49,534 INFO  L93              Difference]: Finished difference Result 29897 states and 118261 transitions.
[2021-06-01 16:20:49,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-06-01 16:20:49,535 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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 91
[2021-06-01 16:20:49,535 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:49,584 INFO  L225             Difference]: With dead ends: 29897
[2021-06-01 16:20:49,584 INFO  L226             Difference]: Without dead ends: 21377
[2021-06-01 16:20:49,584 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 76.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:20:49,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21377 states.
[2021-06-01 16:20:50,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21377 to 20567.
[2021-06-01 16:20:50,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20567 states, 20565 states have (on average 3.914952589350839) internal successors, (80511), 20566 states have internal predecessors, (80511), 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:50,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20567 states to 20567 states and 80511 transitions.
[2021-06-01 16:20:50,426 INFO  L78                 Accepts]: Start accepts. Automaton has 20567 states and 80511 transitions. Word has length 91
[2021-06-01 16:20:50,427 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:50,427 INFO  L482      AbstractCegarLoop]: Abstraction has 20567 states and 80511 transitions.
[2021-06-01 16:20:50,427 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 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:50,427 INFO  L276                IsEmpty]: Start isEmpty. Operand 20567 states and 80511 transitions.
[2021-06-01 16:20:50,459 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2021-06-01 16:20:50,459 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:50,459 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]
[2021-06-01 16:20:50,459 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-01 16:20:50,459 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:20:50,460 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:50,460 INFO  L82        PathProgramCache]: Analyzing trace with hash -293327294, now seen corresponding path program 2 times
[2021-06-01 16:20:50,460 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:50,460 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855483592]
[2021-06-01 16:20:50,460 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:50,500 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:50,564 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:50,565 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:50,565 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855483592]
[2021-06-01 16:20:50,565 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855483592] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:50,565 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:50,565 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 16:20:50,566 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141336672]
[2021-06-01 16:20:50,566 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 16:20:50,566 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:50,567 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 16:20:50,567 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 16:20:50,567 INFO  L87              Difference]: Start difference. First operand 20567 states and 80511 transitions. Second operand  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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:50,829 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:50,830 INFO  L93              Difference]: Finished difference Result 31601 states and 122183 transitions.
[2021-06-01 16:20:50,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2021-06-01 16:20:50,830 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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 91
[2021-06-01 16:20:50,831 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:50,882 INFO  L225             Difference]: With dead ends: 31601
[2021-06-01 16:20:50,882 INFO  L226             Difference]: Without dead ends: 19856
[2021-06-01 16:20:50,882 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 89.0ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:20:50,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19856 states.
[2021-06-01 16:20:51,544 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19856 to 19208.
[2021-06-01 16:20:51,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19208 states, 19206 states have (on average 3.8237009267937103) internal successors, (73438), 19207 states have internal predecessors, (73438), 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:51,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19208 states to 19208 states and 73438 transitions.
[2021-06-01 16:20:51,619 INFO  L78                 Accepts]: Start accepts. Automaton has 19208 states and 73438 transitions. Word has length 91
[2021-06-01 16:20:51,619 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:51,619 INFO  L482      AbstractCegarLoop]: Abstraction has 19208 states and 73438 transitions.
[2021-06-01 16:20:51,619 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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:51,620 INFO  L276                IsEmpty]: Start isEmpty. Operand 19208 states and 73438 transitions.
[2021-06-01 16:20:51,647 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2021-06-01 16:20:51,647 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:51,647 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]
[2021-06-01 16:20:51,647 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-01 16:20:51,647 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:20:51,647 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:51,648 INFO  L82        PathProgramCache]: Analyzing trace with hash -1821145866, now seen corresponding path program 3 times
[2021-06-01 16:20:51,648 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:51,648 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119993564]
[2021-06-01 16:20:51,648 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:51,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:51,762 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:51,762 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:51,762 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119993564]
[2021-06-01 16:20:51,762 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119993564] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:51,763 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:51,763 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-01 16:20:51,763 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721478444]
[2021-06-01 16:20:51,763 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-01 16:20:51,763 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:51,764 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-01 16:20:51,764 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2021-06-01 16:20:51,764 INFO  L87              Difference]: Start difference. First operand 19208 states and 73438 transitions. Second operand  has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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:52,004 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:52,004 INFO  L93              Difference]: Finished difference Result 16076 states and 60991 transitions.
[2021-06-01 16:20:52,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2021-06-01 16:20:52,005 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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 91
[2021-06-01 16:20:52,005 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:52,017 INFO  L225             Difference]: With dead ends: 16076
[2021-06-01 16:20:52,017 INFO  L226             Difference]: Without dead ends: 5649
[2021-06-01 16:20:52,018 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 126.0ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272
[2021-06-01 16:20:52,033 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5649 states.
[2021-06-01 16:20:52,119 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5649 to 5649.
[2021-06-01 16:20:52,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5649 states, 5648 states have (on average 3.7857648725212463) internal successors, (21382), 5648 states have internal predecessors, (21382), 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:52,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5649 states to 5649 states and 21382 transitions.
[2021-06-01 16:20:52,143 INFO  L78                 Accepts]: Start accepts. Automaton has 5649 states and 21382 transitions. Word has length 91
[2021-06-01 16:20:52,143 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:52,143 INFO  L482      AbstractCegarLoop]: Abstraction has 5649 states and 21382 transitions.
[2021-06-01 16:20:52,143 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 9 states have internal predecessors, (91), 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:52,143 INFO  L276                IsEmpty]: Start isEmpty. Operand 5649 states and 21382 transitions.
[2021-06-01 16:20:52,152 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2021-06-01 16:20:52,152 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:52,152 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]
[2021-06-01 16:20:52,152 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-01 16:20:52,153 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:20:52,153 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:52,153 INFO  L82        PathProgramCache]: Analyzing trace with hash -1634702482, now seen corresponding path program 1 times
[2021-06-01 16:20:52,153 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:52,153 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481557074]
[2021-06-01 16:20:52,153 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:52,183 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:52,244 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:52,244 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:52,244 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481557074]
[2021-06-01 16:20:52,245 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481557074] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:52,245 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:52,245 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 16:20:52,245 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832733468]
[2021-06-01 16:20:52,245 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 16:20:52,245 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:52,246 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 16:20:52,246 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-01 16:20:52,246 INFO  L87              Difference]: Start difference. First operand 5649 states and 21382 transitions. Second operand  has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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:52,352 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:52,353 INFO  L93              Difference]: Finished difference Result 7899 states and 29824 transitions.
[2021-06-01 16:20:52,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-06-01 16:20:52,353 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 96
[2021-06-01 16:20:52,354 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:52,363 INFO  L225             Difference]: With dead ends: 7899
[2021-06-01 16:20:52,363 INFO  L226             Difference]: Without dead ends: 3645
[2021-06-01 16:20:52,363 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 77.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2021-06-01 16:20:52,374 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3645 states.
[2021-06-01 16:20:52,425 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3645 to 3645.
[2021-06-01 16:20:52,430 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3645 states, 3644 states have (on average 3.6745334796926454) internal successors, (13390), 3644 states have internal predecessors, (13390), 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:52,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3645 states to 3645 states and 13390 transitions.
[2021-06-01 16:20:52,441 INFO  L78                 Accepts]: Start accepts. Automaton has 3645 states and 13390 transitions. Word has length 96
[2021-06-01 16:20:52,441 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:52,442 INFO  L482      AbstractCegarLoop]: Abstraction has 3645 states and 13390 transitions.
[2021-06-01 16:20:52,442 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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:52,442 INFO  L276                IsEmpty]: Start isEmpty. Operand 3645 states and 13390 transitions.
[2021-06-01 16:20:52,448 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2021-06-01 16:20:52,448 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:52,449 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]
[2021-06-01 16:20:52,449 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-01 16:20:52,449 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:52,449 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:52,449 INFO  L82        PathProgramCache]: Analyzing trace with hash 1793499388, now seen corresponding path program 2 times
[2021-06-01 16:20:52,449 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:52,450 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155505739]
[2021-06-01 16:20:52,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:52,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:20:52,695 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:52,695 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:20:52,696 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155505739]
[2021-06-01 16:20:52,696 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155505739] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:20:52,696 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:20:52,696 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2021-06-01 16:20:52,696 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130566977]
[2021-06-01 16:20:52,696 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 13 states
[2021-06-01 16:20:52,696 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:20:52,697 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2021-06-01 16:20:52,697 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156
[2021-06-01 16:20:52,697 INFO  L87              Difference]: Start difference. First operand 3645 states and 13390 transitions. Second operand  has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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:52,874 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:20:52,875 INFO  L93              Difference]: Finished difference Result 5415 states and 19928 transitions.
[2021-06-01 16:20:52,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2021-06-01 16:20:52,875 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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 96
[2021-06-01 16:20:52,875 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:20:52,882 INFO  L225             Difference]: With dead ends: 5415
[2021-06-01 16:20:52,882 INFO  L226             Difference]: Without dead ends: 2637
[2021-06-01 16:20:52,883 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 197.6ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240
[2021-06-01 16:20:52,890 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2637 states.
[2021-06-01 16:20:52,923 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 2637.
[2021-06-01 16:20:52,926 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2637 states, 2636 states have (on average 3.540971168437026) internal successors, (9334), 2636 states have internal predecessors, (9334), 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:52,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2637 states to 2637 states and 9334 transitions.
[2021-06-01 16:20:52,934 INFO  L78                 Accepts]: Start accepts. Automaton has 2637 states and 9334 transitions. Word has length 96
[2021-06-01 16:20:52,934 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:20:52,934 INFO  L482      AbstractCegarLoop]: Abstraction has 2637 states and 9334 transitions.
[2021-06-01 16:20:52,934 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 13 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 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:52,934 INFO  L276                IsEmpty]: Start isEmpty. Operand 2637 states and 9334 transitions.
[2021-06-01 16:20:52,938 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2021-06-01 16:20:52,939 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:20:52,939 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]
[2021-06-01 16:20:52,939 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-01 16:20:52,939 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:52,939 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:20:52,939 INFO  L82        PathProgramCache]: Analyzing trace with hash -1862235204, now seen corresponding path program 3 times
[2021-06-01 16:20:52,940 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:20:52,940 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734156083]
[2021-06-01 16:20:52,940 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:20:52,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 16:20:52,982 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 16:20:53,271 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 16:20:53,272 INFO  L223             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 16:20:53,314 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-01 16:20:53,315 INFO  L655         BasicCegarLoop]: Counterexample might be feasible
[2021-06-01 16:20:53,315 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-01 16:20:53,315 INFO  L301   ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/3)
[2021-06-01 16:20:53,316 INFO  L255      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 16:20:53,317 INFO  L378      AbstractCegarLoop]: Interprodecural is true
[2021-06-01 16:20:53,317 INFO  L379      AbstractCegarLoop]: Hoare is false
[2021-06-01 16:20:53,317 INFO  L380      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 16:20:53,317 INFO  L381      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 16:20:53,318 INFO  L382      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 16:20:53,318 INFO  L383      AbstractCegarLoop]: Difference is false
[2021-06-01 16:20:53,318 INFO  L384      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 16:20:53,318 INFO  L388      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P3Thread1of1ForFork1========
[2021-06-01 16:20:53,320 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 136 places, 125 transitions, 270 flow
[2021-06-01 16:21:10,129 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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:21:10,272 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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:21:10,274 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2021-06-01 16:21:10,274 INFO  L546         BasicCegarLoop]: Found error trace
[2021-06-01 16:21:10,274 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]
[2021-06-01 16:21:10,274 INFO  L430      AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 16:21:10,275 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 16:21:10,275 INFO  L82        PathProgramCache]: Analyzing trace with hash -882581900, now seen corresponding path program 1 times
[2021-06-01 16:21:10,275 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 16:21:10,275 INFO  L361   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360205499]
[2021-06-01 16:21:10,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 16:21:10,284 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 16:21:10,305 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:21:10,305 INFO  L179   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 16:21:10,305 INFO  L361   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360205499]
[2021-06-01 16:21:10,305 INFO  L200   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360205499] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 16:21:10,305 INFO  L226   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 16:21:10,305 INFO  L239   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-01 16:21:10,305 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432212720]
[2021-06-01 16:21:10,306 INFO  L462      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-01 16:21:10,306 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 16:21:10,306 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-01 16:21:10,306 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:21:10,452 INFO  L87              Difference]: Start difference. First operand  has 105491 states, 105487 states have (on average 4.480296150236522) internal successors, (472613), 105490 states have internal predecessors, (472613), 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 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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:21:11,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 16:21:11,263 INFO  L93              Difference]: Finished difference Result 90987 states and 399778 transitions.
[2021-06-01 16:21:11,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-06-01 16:21:11,264 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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 66
[2021-06-01 16:21:11,264 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 16:21:11,265 INFO  L225             Difference]: With dead ends: 90987
[2021-06-01 16:21:11,265 INFO  L226             Difference]: Without dead ends: 0
[2021-06-01 16:21:11,265 INFO  L810         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 16:21:11,265 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-01 16:21:11,265 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-01 16:21:11,265 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:21:11,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-01 16:21:11,265 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66
[2021-06-01 16:21:11,265 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-06-01 16:21:11,265 INFO  L482      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-01 16:21:11,265 INFO  L483      AbstractCegarLoop]: Interpolant automaton has  has 3 states, 2 states have (on average 33.0) internal successors, (66), 3 states have internal predecessors, (66), 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:21:11,265 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-01 16:21:11,265 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 16:21:11,266 WARN  L519      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-06-01 16:21:11,266 INFO  L301   ceAbstractionStarter]: Result for error location P3Thread1of1ForFork1 was SAFE (3/3)
[2021-06-01 16:21:11,266 INFO  L247   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-01 16:21:11,440 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.06 04:21:11 BasicIcfg
[2021-06-01 16:21:11,442 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-01 16:21:11,442 INFO  L168              Benchmark]: Toolchain (without parser) took 84352.10 ms. Allocated memory was 333.4 MB in the beginning and 13.8 GB in the end (delta: 13.5 GB). Free memory was 296.0 MB in the beginning and 9.6 GB in the end (delta: -9.3 GB). Peak memory consumption was 4.2 GB. Max. memory is 16.0 GB.
[2021-06-01 16:21:11,442 INFO  L168              Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 333.4 MB. Free memory was 314.1 MB in the beginning and 314.1 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-01 16:21:11,443 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 618.10 ms. Allocated memory is still 333.4 MB. Free memory was 295.8 MB in the beginning and 292.1 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB.
[2021-06-01 16:21:11,443 INFO  L168              Benchmark]: Boogie Procedure Inliner took 79.46 ms. Allocated memory is still 333.4 MB. Free memory was 292.1 MB in the beginning and 289.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 16:21:11,443 INFO  L168              Benchmark]: Boogie Preprocessor took 45.53 ms. Allocated memory is still 333.4 MB. Free memory was 289.0 MB in the beginning and 286.9 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:21:11,443 INFO  L168              Benchmark]: RCFGBuilder took 1643.13 ms. Allocated memory is still 333.4 MB. Free memory was 286.9 MB in the beginning and 243.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 144.5 MB. Max. memory is 16.0 GB.
[2021-06-01 16:21:11,443 INFO  L168              Benchmark]: TraceAbstraction took 81959.05 ms. Allocated memory was 333.4 MB in the beginning and 13.8 GB in the end (delta: 13.5 GB). Free memory was 243.1 MB in the beginning and 9.6 GB in the end (delta: -9.3 GB). Peak memory consumption was 4.2 GB. Max. memory is 16.0 GB.
[2021-06-01 16:21:11,444 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.16 ms. Allocated memory is still 333.4 MB. Free memory was 314.1 MB in the beginning and 314.1 MB in the end (delta: 70.4 kB). There was no memory consumed. Max. memory is 16.0 GB.
 * CACSL2BoogieTranslator took 618.10 ms. Allocated memory is still 333.4 MB. Free memory was 295.8 MB in the beginning and 292.1 MB in the end (delta: 3.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB.
 * Boogie Procedure Inliner took 79.46 ms. Allocated memory is still 333.4 MB. Free memory was 292.1 MB in the beginning and 289.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * Boogie Preprocessor took 45.53 ms. Allocated memory is still 333.4 MB. Free memory was 289.0 MB in the beginning and 286.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
 * RCFGBuilder took 1643.13 ms. Allocated memory is still 333.4 MB. Free memory was 286.9 MB in the beginning and 243.1 MB in the end (delta: 43.8 MB). Peak memory consumption was 144.5 MB. Max. memory is 16.0 GB.
 * TraceAbstraction took 81959.05 ms. Allocated memory was 333.4 MB in the beginning and 13.8 GB in the end (delta: 13.5 GB). Free memory was 243.1 MB in the beginning and 9.6 GB in the end (delta: -9.3 GB). Peak memory consumption was 4.2 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_p1_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0]
[L714]               0  int __unbuffered_p3_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0]
[L716]               0  int a = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0]
[L717]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0]
[L718]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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_p1_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_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L724]               0  int z = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0]
[L725]               0  _Bool z$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0]
[L726]               0  int z$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0]
[L727]               0  _Bool z$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0]
[L728]               0  _Bool z$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0]
[L729]               0  _Bool z$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0]
[L730]               0  _Bool z$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0]
[L731]               0  _Bool z$r_buff0_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0]
[L732]               0  _Bool z$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0]
[L733]               0  _Bool z$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0]
[L734]               0  _Bool z$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0]
[L735]               0  _Bool z$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0]
[L736]               0  _Bool z$r_buff1_thd4;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0]
[L737]               0  _Bool z$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0]
[L738]               0  int *z$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}]
[L739]               0  int z$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0]
[L740]               0  _Bool z$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0]
[L741]               0  int z$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0]
[L742]               0  _Bool z$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L743]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L744]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L836]               0  pthread_t t1477;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L837]  FCALL, FORK  0  pthread_create(&t1477, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L838]               0  pthread_t t1478;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L839]  FCALL, FORK  0  pthread_create(&t1478, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L840]               0  pthread_t t1479;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L841]  FCALL, FORK  0  pthread_create(&t1479, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L842]               0  pthread_t t1480;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L843]  FCALL, FORK  0  pthread_create(&t1480, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L798]               4  z$w_buff1 = z$w_buff0
[L799]               4  z$w_buff0 = 2
[L800]               4  z$w_buff1_used = z$w_buff0_used
[L801]               4  z$w_buff0_used = (_Bool)1
[L18]   COND FALSE   4  !(!expression)
[L803]               4  z$r_buff1_thd0 = z$r_buff0_thd0
[L804]               4  z$r_buff1_thd1 = z$r_buff0_thd1
[L805]               4  z$r_buff1_thd2 = z$r_buff0_thd2
[L806]               4  z$r_buff1_thd3 = z$r_buff0_thd3
[L807]               4  z$r_buff1_thd4 = z$r_buff0_thd4
[L808]               4  z$r_buff0_thd4 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L811]               4  __unbuffered_p3_EAX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L748]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L751]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L756]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L763]               2  x = 2
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L766]               2  __unbuffered_p1_EAX = y
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L771]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L778]               3  y = 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L781]               3  z = 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_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, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0]
[L814]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L814]               4  z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z)
[L815]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L815]               4  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used
[L816]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L816]               4  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used
[L817]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L817]               4  z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4
[L818]  EXPR         4  z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L818]               4  z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4
[L821]               4  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p1_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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L784]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L784]  EXPR         3  z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z
[L784]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L784]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L785]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L785]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L786]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L786]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L787]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L787]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L788]  EXPR         3  z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L788]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
[L791]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=4, __unbuffered_p1_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, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L845]               0  main$tmp_guard0 = __unbuffered_cnt == 4
        VAL             [__unbuffered_cnt=4, __unbuffered_p1_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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L3]    COND FALSE   0  !(!cond)
        VAL             [__unbuffered_cnt=4, __unbuffered_p1_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=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L849]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L849]  EXPR         0  z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z
[L849]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L849]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L850]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L850]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L851]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L851]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L852]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L852]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L853]  EXPR         0  z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L853]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
[L856]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L857]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L858]               0  z$flush_delayed = weak$$choice2
[L859]               0  z$mem_tmp = z
[L860]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L860]               0  z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1)
[L861]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L861]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)
[L861]  EXPR         0  weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L861]               0  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0))
[L862]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L862]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)
[L862]  EXPR         0  weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L862]               0  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1))
[L863]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L863]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)
[L863]  EXPR         0  weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L863]               0  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used))
[L864]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L864]  EXPR         0  weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L864]               0  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L865]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L865]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)
[L865]  EXPR         0  weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L865]               0  z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0))
[L866]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L866]  EXPR         0  !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)
[L866]  EXPR         0  weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L866]               0  z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L867]               0  main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0)
[L868]  EXPR         0  z$flush_delayed ? z$mem_tmp : z
[L868]               0  z = z$flush_delayed ? z$mem_tmp : z
[L869]               0  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=4, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L18]   COND TRUE    0  !expression
        VAL             [__unbuffered_cnt=4, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]
[L18]                0  reach_error()
        VAL             [__unbuffered_cnt=4, __unbuffered_p1_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=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0]

  - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P3 with 1 thread instances
    CFG has 9 procedures, 159 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 19453.3ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 927.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18522.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105491occurred 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: ULTIMATE.start with 1 thread instances
    CFG has 9 procedures, 159 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 44262.3ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 1008.3ms, AutomataDifference: 8831.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 17559.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2070 SDtfs, 3635 SDslu, 7915 SDs, 0 SdLazy, 792 SolverSat, 187 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 790.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1692.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105491occurred in iteration=0, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 14110.5ms AutomataMinimizationTime, 12 MinimizatonAttempts, 1458 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 54.0ms SsaConstructionTime, 539.6ms SatisfiabilityAnalysisTime, 1576.9ms InterpolantComputationTime, 1142 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1034 ConstructedInterpolants, 0 QuantifiedInterpolants, 4748 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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: P3Thread1of1ForFork1 with 1 thread instances
    CFG has 9 procedures, 159 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 17948.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 144.4ms, AutomataDifference: 958.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 16811.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 113 SDtfs, 43 SDslu, 78 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=105491occurred 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: 0.3ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.6ms SsaConstructionTime, 4.3ms SatisfiabilityAnalysisTime, 20.1ms InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 133 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
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...