/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/mix027_tso.oepc.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-98707888a4ba860d5b57d27ee0e051c5b948cbbf-9870788
[2021-06-01 15:43:28,854 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-06-01 15:43:28,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-06-01 15:43:28,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-06-01 15:43:28,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-06-01 15:43:28,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-06-01 15:43:28,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-06-01 15:43:28,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-06-01 15:43:28,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-06-01 15:43:28,912 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-06-01 15:43:28,913 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-06-01 15:43:28,914 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-06-01 15:43:28,915 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-06-01 15:43:28,916 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-06-01 15:43:28,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-06-01 15:43:28,918 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-06-01 15:43:28,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-06-01 15:43:28,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-06-01 15:43:28,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-06-01 15:43:28,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-06-01 15:43:28,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-06-01 15:43:28,931 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-06-01 15:43:28,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-06-01 15:43:28,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-06-01 15:43:28,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-06-01 15:43:28,940 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-06-01 15:43:28,940 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-06-01 15:43:28,941 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-06-01 15:43:28,942 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-06-01 15:43:28,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-06-01 15:43:28,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-06-01 15:43:28,943 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-06-01 15:43:28,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-06-01 15:43:28,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-06-01 15:43:28,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-06-01 15:43:28,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-06-01 15:43:28,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-06-01 15:43:28,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-06-01 15:43:28,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-06-01 15:43:28,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-06-01 15:43:28,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-06-01 15:43:28,952 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 15:43:28,988 INFO L113 SettingsManager]: Loading preferences was successful
[2021-06-01 15:43:28,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-06-01 15:43:28,989 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-06-01 15:43:28,989 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-06-01 15:43:28,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-06-01 15:43:28,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-06-01 15:43:28,992 INFO L138 SettingsManager]: * Use SBE=true
[2021-06-01 15:43:28,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-06-01 15:43:28,992 INFO L138 SettingsManager]: * sizeof long=4
[2021-06-01 15:43:28,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-06-01 15:43:28,993 INFO L138 SettingsManager]: * sizeof POINTER=4
[2021-06-01 15:43:28,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-06-01 15:43:28,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-06-01 15:43:28,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-06-01 15:43:28,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-06-01 15:43:28,994 INFO L138 SettingsManager]: * sizeof long double=12
[2021-06-01 15:43:28,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-06-01 15:43:28,994 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-06-01 15:43:28,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-06-01 15:43:28,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-06-01 15:43:28,995 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-06-01 15:43:28,995 INFO L138 SettingsManager]: * To the following directory=./dump/
[2021-06-01 15:43:28,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-06-01 15:43:28,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-06-01 15:43:28,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-06-01 15:43:28,996 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-06-01 15:43:28,996 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-06-01 15:43:28,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-06-01 15:43:28,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-06-01 15:43:28,996 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF
[2021-06-01 15:43:28,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-06-01 15:43:28,996 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 15:43:29,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-06-01 15:43:29,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-06-01 15:43:29,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-06-01 15:43:29,330 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-06-01 15:43:29,330 INFO L275 PluginConnector]: CDTParser initialized
[2021-06-01 15:43:29,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.oepc.i
[2021-06-01 15:43:29,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecef9182c/e35730b4ab06449d84553a6a9ef79be0/FLAG6e168dd68
[2021-06-01 15:43:29,921 INFO L306 CDTParser]: Found 1 translation units.
[2021-06-01 15:43:29,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.oepc.i
[2021-06-01 15:43:29,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecef9182c/e35730b4ab06449d84553a6a9ef79be0/FLAG6e168dd68
[2021-06-01 15:43:30,370 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecef9182c/e35730b4ab06449d84553a6a9ef79be0
[2021-06-01 15:43:30,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-06-01 15:43:30,374 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements.
[2021-06-01 15:43:30,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-06-01 15:43:30,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-06-01 15:43:30,382 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-06-01 15:43:30,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:30,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc108f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30, skipping insertion in model container
[2021-06-01 15:43:30,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:30,389 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-06-01 15:43:30,449 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-06-01 15:43:30,604 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/mix027_tso.oepc.i[949,962]
[2021-06-01 15:43:30,778 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-01 15:43:30,785 INFO L203 MainTranslator]: Completed pre-run
[2021-06-01 15:43:30,794 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/mix027_tso.oepc.i[949,962]
[2021-06-01 15:43:30,828 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-06-01 15:43:30,899 INFO L208 MainTranslator]: Completed translation
[2021-06-01 15:43:30,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30 WrapperNode
[2021-06-01 15:43:30,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-06-01 15:43:30,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-06-01 15:43:30,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-06-01 15:43:30,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-06-01 15:43:30,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:30,952 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:30,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-06-01 15:43:30,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-06-01 15:43:30,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-06-01 15:43:30,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-06-01 15:43:30,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:30,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:31,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:31,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:31,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:31,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:31,028 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (1/1) ...
[2021-06-01 15:43:31,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-06-01 15:43:31,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-06-01 15:43:31,051 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-06-01 15:43:31,051 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-06-01 15:43:31,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (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 15:43:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-06-01 15:43:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-06-01 15:43:31,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-06-01 15:43:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-06-01 15:43:31,127 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-06-01 15:43:31,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-06-01 15:43:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-06-01 15:43:31,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-06-01 15:43:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-06-01 15:43:31,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-06-01 15:43:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2021-06-01 15:43:31,129 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2021-06-01 15:43:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-06-01 15:43:31,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-06-01 15:43:31,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-06-01 15:43:31,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-06-01 15:43:31,132 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 15:43:33,306 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-06-01 15:43:33,306 INFO L299 CfgBuilder]: Removed 10 assume(true) statements.
[2021-06-01 15:43:33,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 03:43:33 BoogieIcfgContainer
[2021-06-01 15:43:33,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-06-01 15:43:33,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-06-01 15:43:33,311 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-06-01 15:43:33,313 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-06-01 15:43:33,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.06 03:43:30" (1/3) ...
[2021-06-01 15:43:33,314 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1d58f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 03:43:33, skipping insertion in model container
[2021-06-01 15:43:33,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.06 03:43:30" (2/3) ...
[2021-06-01 15:43:33,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1d58f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.06 03:43:33, skipping insertion in model container
[2021-06-01 15:43:33,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.06 03:43:33" (3/3) ...
[2021-06-01 15:43:33,316 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.oepc.i
[2021-06-01 15:43:33,322 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-06-01 15:43:33,322 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-06-01 15:43:33,322 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2021-06-01 15:43:33,323 INFO L471 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-06-01 15:43:33,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,360 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,361 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,365 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,365 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,366 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,366 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,367 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,367 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,368 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,369 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,370 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,371 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,371 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,371 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,371 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,372 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,373 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,375 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,375 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,375 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,376 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,376 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,377 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,378 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,380 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,381 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,386 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,387 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,388 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,389 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,391 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,392 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,392 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,393 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,394 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,397 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,397 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,398 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,398 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-06-01 15:43:33,401 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-06-01 15:43:33,419 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 15:43:33,441 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:43:33,441 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 15:43:33,441 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:43:33,441 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:43:33,441 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:43:33,441 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 15:43:33,441 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:43:33,441 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1========
[2021-06-01 15:43:33,456 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 129 transitions, 278 flow
[2021-06-01 15:44:13,542 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 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 15:44:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 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 15:44:14,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 15:44:14,873 INFO L301 ceAbstractionStarter]: Result for error location P1 was SAFE (1/3)
[2021-06-01 15:44:14,875 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2021-06-01 15:44:14,877 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:44:14,877 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 15:44:14,877 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:44:14,877 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:44:14,877 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:44:14,877 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 15:44:14,877 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:44:14,877 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P1Thread1of1ForFork3========
[2021-06-01 15:44:14,886 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 129 transitions, 278 flow
[2021-06-01 15:44:52,820 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 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 15:44:53,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 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 15:44:53,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2021-06-01 15:44:53,035 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:44:53,036 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]
[2021-06-01 15:44:53,036 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:44:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:44:53,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1619171300, now seen corresponding path program 1 times
[2021-06-01 15:44:53,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:44:53,048 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332400242]
[2021-06-01 15:44:53,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:44:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:44:53,341 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 15:44:53,342 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:44:53,343 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332400242]
[2021-06-01 15:44:53,343 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332400242] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:44:53,343 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:44:53,344 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-06-01 15:44:53,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538670341]
[2021-06-01 15:44:53,348 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-06-01 15:44:53,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:44:53,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-06-01 15:44:53,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 15:44:53,574 INFO L87 Difference]: Start difference. First operand has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 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 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 15:44:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:44:55,396 INFO L93 Difference]: Finished difference Result 133156 states and 592165 transitions.
[2021-06-01 15:44:55,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2021-06-01 15:44:55,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53
[2021-06-01 15:44:55,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:44:55,403 INFO L225 Difference]: With dead ends: 133156
[2021-06-01 15:44:55,403 INFO L226 Difference]: Without dead ends: 0
[2021-06-01 15:44:55,404 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-06-01 15:44:55,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2021-06-01 15:44:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2021-06-01 15:44:55,422 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 15:44:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2021-06-01 15:44:55,424 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53
[2021-06-01 15:44:55,424 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:44:55,424 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2021-06-01 15:44:55,424 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 15:44:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2021-06-01 15:44:55,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2021-06-01 15:44:55,429 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-06-01 15:44:55,432 INFO L301 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork3 was SAFE (2/3)
[2021-06-01 15:44:55,434 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2021-06-01 15:44:55,439 INFO L378 AbstractCegarLoop]: Interprodecural is true
[2021-06-01 15:44:55,439 INFO L379 AbstractCegarLoop]: Hoare is false
[2021-06-01 15:44:55,441 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-06-01 15:44:55,441 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-06-01 15:44:55,441 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-06-01 15:44:55,441 INFO L383 AbstractCegarLoop]: Difference is false
[2021-06-01 15:44:55,441 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-06-01 15:44:55,441 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start========
[2021-06-01 15:44:55,445 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 129 transitions, 278 flow
[2021-06-01 15:45:34,473 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 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 15:45:34,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 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 15:45:35,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2021-06-01 15:45:35,075 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:35,075 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:45:35,075 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash -272929157, now seen corresponding path program 1 times
[2021-06-01 15:45:35,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:35,076 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434296489]
[2021-06-01 15:45:35,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:35,374 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 15:45:35,374 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:35,374 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434296489]
[2021-06-01 15:45:35,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434296489] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:35,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:35,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:45:35,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427772993]
[2021-06-01 15:45:35,377 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:45:35,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:35,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:45:35,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:45:35,559 INFO L87 Difference]: Start difference. First operand has 154972 states, 154968 states have (on average 4.530522430437252) internal successors, (702086), 154971 states have internal predecessors, (702086), 0 states have call successors, (0), 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.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:37,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:37,579 INFO L93 Difference]: Finished difference Result 201628 states and 896054 transitions.
[2021-06-01 15:45:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 15:45:37,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79
[2021-06-01 15:45:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:38,539 INFO L225 Difference]: With dead ends: 201628
[2021-06-01 15:45:38,539 INFO L226 Difference]: Without dead ends: 72028
[2021-06-01 15:45:38,540 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 89.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:45:39,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72028 states.
[2021-06-01 15:45:41,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72028 to 72028.
[2021-06-01 15:45:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72028 states, 72026 states have (on average 4.373615083442091) internal successors, (315014), 72027 states have internal predecessors, (315014), 0 states have call successors, (0), 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 15:45:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72028 states to 72028 states and 315014 transitions.
[2021-06-01 15:45:42,351 INFO L78 Accepts]: Start accepts. Automaton has 72028 states and 315014 transitions. Word has length 79
[2021-06-01 15:45:42,352 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:45:42,353 INFO L482 AbstractCegarLoop]: Abstraction has 72028 states and 315014 transitions.
[2021-06-01 15:45:42,353 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 72028 states and 315014 transitions.
[2021-06-01 15:45:42,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2021-06-01 15:45:42,467 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:42,467 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:45:42,467 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-06-01 15:45:42,467 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:42,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1253010600, now seen corresponding path program 1 times
[2021-06-01 15:45:42,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:42,468 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27874404]
[2021-06-01 15:45:42,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:42,766 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 15:45:42,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:42,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27874404]
[2021-06-01 15:45:42,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27874404] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:42,767 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:42,767 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-01 15:45:42,767 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600983682]
[2021-06-01 15:45:42,768 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-01 15:45:42,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:42,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-01 15:45:42,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:45:42,769 INFO L87 Difference]: Start difference. First operand 72028 states and 315014 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:44,124 INFO L93 Difference]: Finished difference Result 84199 states and 365651 transitions.
[2021-06-01 15:45:44,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states.
[2021-06-01 15:45:44,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82
[2021-06-01 15:45:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:44,725 INFO L225 Difference]: With dead ends: 84199
[2021-06-01 15:45:44,725 INFO L226 Difference]: Without dead ends: 69991
[2021-06-01 15:45:44,726 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 228.8ms TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342
[2021-06-01 15:45:45,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69991 states.
[2021-06-01 15:45:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69991 to 69991.
[2021-06-01 15:45:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69991 states, 69989 states have (on average 4.3585563445684326) internal successors, (305051), 69990 states have internal predecessors, (305051), 0 states have call successors, (0), 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 15:45:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69991 states to 69991 states and 305051 transitions.
[2021-06-01 15:45:47,427 INFO L78 Accepts]: Start accepts. Automaton has 69991 states and 305051 transitions. Word has length 82
[2021-06-01 15:45:47,428 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:45:47,428 INFO L482 AbstractCegarLoop]: Abstraction has 69991 states and 305051 transitions.
[2021-06-01 15:45:47,428 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-06-01 15:45:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 69991 states and 305051 transitions.
[2021-06-01 15:45:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2021-06-01 15:45:47,959 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:47,960 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 15:45:47,960 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-06-01 15:45:47,960 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1709294041, now seen corresponding path program 1 times
[2021-06-01 15:45:47,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:47,967 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004728914]
[2021-06-01 15:45:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:48,273 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 15:45:48,273 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:48,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004728914]
[2021-06-01 15:45:48,277 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004728914] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:48,277 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:48,277 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-01 15:45:48,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590168410]
[2021-06-01 15:45:48,278 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-01 15:45:48,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:48,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-01 15:45:48,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2021-06-01 15:45:48,279 INFO L87 Difference]: Start difference. First operand 69991 states and 305051 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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 15:45:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:48,929 INFO L93 Difference]: Finished difference Result 69796 states and 302245 transitions.
[2021-06-01 15:45:48,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-06-01 15:45:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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 15:45:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:49,701 INFO L225 Difference]: With dead ends: 69796
[2021-06-01 15:45:49,701 INFO L226 Difference]: Without dead ends: 62116
[2021-06-01 15:45:49,701 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 147.4ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182
[2021-06-01 15:45:50,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62116 states.
[2021-06-01 15:45:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62116 to 62116.
[2021-06-01 15:45:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62116 states, 62115 states have (on average 4.347114223617484) internal successors, (270021), 62115 states have internal predecessors, (270021), 0 states have call successors, (0), 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 15:45:51,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62116 states to 62116 states and 270021 transitions.
[2021-06-01 15:45:51,937 INFO L78 Accepts]: Start accepts. Automaton has 62116 states and 270021 transitions. Word has length 85
[2021-06-01 15:45:51,937 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:45:51,937 INFO L482 AbstractCegarLoop]: Abstraction has 62116 states and 270021 transitions.
[2021-06-01 15:45:51,937 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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 15:45:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 62116 states and 270021 transitions.
[2021-06-01 15:45:52,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2021-06-01 15:45:52,032 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:52,032 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]
[2021-06-01 15:45:52,033 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-06-01 15:45:52,033 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:52,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:52,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1618434219, now seen corresponding path program 1 times
[2021-06-01 15:45:52,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:52,033 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171130147]
[2021-06-01 15:45:52,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:52,200 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 15:45:52,200 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:52,200 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171130147]
[2021-06-01 15:45:52,201 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171130147] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:52,201 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:52,201 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:45:52,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702483455]
[2021-06-01 15:45:52,202 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:45:52,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:52,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:45:52,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:45:52,203 INFO L87 Difference]: Start difference. First operand 62116 states and 270021 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 15:45:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:52,744 INFO L93 Difference]: Finished difference Result 75874 states and 325333 transitions.
[2021-06-01 15:45:52,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 15:45:52,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 86
[2021-06-01 15:45:52,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:53,395 INFO L225 Difference]: With dead ends: 75874
[2021-06-01 15:45:53,395 INFO L226 Difference]: Without dead ends: 56194
[2021-06-01 15:45:53,395 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 89.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:45:53,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56194 states.
[2021-06-01 15:45:54,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56194 to 56194.
[2021-06-01 15:45:54,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56194 states, 56193 states have (on average 4.278308686135284) internal successors, (240411), 56193 states have internal predecessors, (240411), 0 states have call successors, (0), 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 15:45:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56194 states to 56194 states and 240411 transitions.
[2021-06-01 15:45:54,962 INFO L78 Accepts]: Start accepts. Automaton has 56194 states and 240411 transitions. Word has length 86
[2021-06-01 15:45:54,962 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:45:54,963 INFO L482 AbstractCegarLoop]: Abstraction has 56194 states and 240411 transitions.
[2021-06-01 15:45:54,963 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 0 states have call successors, (0), 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 15:45:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 56194 states and 240411 transitions.
[2021-06-01 15:45:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2021-06-01 15:45:55,036 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:55,036 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 15:45:55,036 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-06-01 15:45:55,036 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:55,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1287253463, now seen corresponding path program 1 times
[2021-06-01 15:45:55,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:55,037 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957829102]
[2021-06-01 15:45:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:55,147 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 15:45:55,147 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:55,147 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957829102]
[2021-06-01 15:45:55,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957829102] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:55,148 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:55,148 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 15:45:55,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927513771]
[2021-06-01 15:45:55,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 15:45:55,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:55,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 15:45:55,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2021-06-01 15:45:55,149 INFO L87 Difference]: Start difference. First operand 56194 states and 240411 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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 15:45:56,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:56,087 INFO L93 Difference]: Finished difference Result 56776 states and 237052 transitions.
[2021-06-01 15:45:56,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states.
[2021-06-01 15:45:56,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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 15:45:56,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:56,201 INFO L225 Difference]: With dead ends: 56776
[2021-06-01 15:45:56,201 INFO L226 Difference]: Without dead ends: 40336
[2021-06-01 15:45:56,201 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 102.2ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156
[2021-06-01 15:45:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40336 states.
[2021-06-01 15:45:57,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40336 to 39520.
[2021-06-01 15:45:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39520 states, 39519 states have (on average 4.1224474303499585) internal successors, (162915), 39519 states have internal predecessors, (162915), 0 states have call successors, (0), 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 15:45:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39520 states to 39520 states and 162915 transitions.
[2021-06-01 15:45:57,492 INFO L78 Accepts]: Start accepts. Automaton has 39520 states and 162915 transitions. Word has length 87
[2021-06-01 15:45:57,493 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:45:57,493 INFO L482 AbstractCegarLoop]: Abstraction has 39520 states and 162915 transitions.
[2021-06-01 15:45:57,493 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 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 15:45:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 39520 states and 162915 transitions.
[2021-06-01 15:45:57,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2021-06-01 15:45:57,553 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:57,553 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]
[2021-06-01 15:45:57,554 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-06-01 15:45:57,554 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:57,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:57,554 INFO L82 PathProgramCache]: Analyzing trace with hash 767359199, now seen corresponding path program 1 times
[2021-06-01 15:45:57,554 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:57,554 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659958368]
[2021-06-01 15:45:57,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:57,707 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 15:45:57,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:57,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659958368]
[2021-06-01 15:45:57,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659958368] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:57,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:57,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2021-06-01 15:45:57,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954928757]
[2021-06-01 15:45:57,708 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-06-01 15:45:57,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-06-01 15:45:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2021-06-01 15:45:57,709 INFO L87 Difference]: Start difference. First operand 39520 states and 162915 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 15:45:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:58,064 INFO L93 Difference]: Finished difference Result 33958 states and 137193 transitions.
[2021-06-01 15:45:58,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states.
[2021-06-01 15:45:58,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 90
[2021-06-01 15:45:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:58,136 INFO L225 Difference]: With dead ends: 33958
[2021-06-01 15:45:58,136 INFO L226 Difference]: Without dead ends: 25210
[2021-06-01 15:45:58,136 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 117.6ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210
[2021-06-01 15:45:58,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25210 states.
[2021-06-01 15:45:58,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25210 to 24922.
[2021-06-01 15:45:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24922 states, 24921 states have (on average 4.0008426628144935) internal successors, (99705), 24921 states have internal predecessors, (99705), 0 states have call successors, (0), 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 15:45:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24922 states to 24922 states and 99705 transitions.
[2021-06-01 15:45:59,056 INFO L78 Accepts]: Start accepts. Automaton has 24922 states and 99705 transitions. Word has length 90
[2021-06-01 15:45:59,056 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:45:59,056 INFO L482 AbstractCegarLoop]: Abstraction has 24922 states and 99705 transitions.
[2021-06-01 15:45:59,056 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 0 states have call successors, (0), 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 15:45:59,057 INFO L276 IsEmpty]: Start isEmpty. Operand 24922 states and 99705 transitions.
[2021-06-01 15:45:59,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-06-01 15:45:59,096 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:45:59,096 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]
[2021-06-01 15:45:59,096 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-06-01 15:45:59,096 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:45:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:45:59,097 INFO L82 PathProgramCache]: Analyzing trace with hash 871265229, now seen corresponding path program 1 times
[2021-06-01 15:45:59,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:45:59,097 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141634974]
[2021-06-01 15:45:59,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:45:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:45:59,254 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 15:45:59,255 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:45:59,255 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141634974]
[2021-06-01 15:45:59,255 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141634974] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:45:59,255 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:45:59,255 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-06-01 15:45:59,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667684119]
[2021-06-01 15:45:59,257 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-06-01 15:45:59,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:45:59,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-06-01 15:45:59,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2021-06-01 15:45:59,258 INFO L87 Difference]: Start difference. First operand 24922 states and 99705 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 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 15:45:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:45:59,547 INFO L93 Difference]: Finished difference Result 36136 states and 144282 transitions.
[2021-06-01 15:45:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-06-01 15:45:59,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 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 95
[2021-06-01 15:45:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:45:59,977 INFO L225 Difference]: With dead ends: 36136
[2021-06-01 15:45:59,977 INFO L226 Difference]: Without dead ends: 25732
[2021-06-01 15:45:59,990 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 75.1ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:46:00,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25732 states.
[2021-06-01 15:46:00,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25732 to 24922.
[2021-06-01 15:46:00,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24922 states, 24921 states have (on average 3.948116046707596) internal successors, (98391), 24921 states have internal predecessors, (98391), 0 states have call successors, (0), 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 15:46:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24922 states to 24922 states and 98391 transitions.
[2021-06-01 15:46:00,497 INFO L78 Accepts]: Start accepts. Automaton has 24922 states and 98391 transitions. Word has length 95
[2021-06-01 15:46:00,497 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:00,497 INFO L482 AbstractCegarLoop]: Abstraction has 24922 states and 98391 transitions.
[2021-06-01 15:46:00,497 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 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 15:46:00,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24922 states and 98391 transitions.
[2021-06-01 15:46:00,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-06-01 15:46:00,537 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:00,537 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]
[2021-06-01 15:46:00,537 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-06-01 15:46:00,537 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:00,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:00,537 INFO L82 PathProgramCache]: Analyzing trace with hash 819880593, now seen corresponding path program 2 times
[2021-06-01 15:46:00,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:00,538 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6545180]
[2021-06-01 15:46:00,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:00,829 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 15:46:00,829 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:00,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6545180]
[2021-06-01 15:46:00,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6545180] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:00,830 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:00,830 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2021-06-01 15:46:00,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587086070]
[2021-06-01 15:46:00,830 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states
[2021-06-01 15:46:00,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:00,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2021-06-01 15:46:00,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2021-06-01 15:46:00,831 INFO L87 Difference]: Start difference. First operand 24922 states and 98391 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 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 15:46:01,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:01,859 INFO L93 Difference]: Finished difference Result 51592 states and 201402 transitions.
[2021-06-01 15:46:01,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-01 15:46:01,860 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 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 95
[2021-06-01 15:46:01,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:01,980 INFO L225 Difference]: With dead ends: 51592
[2021-06-01 15:46:01,980 INFO L226 Difference]: Without dead ends: 44812
[2021-06-01 15:46:01,980 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 380.4ms TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420
[2021-06-01 15:46:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44812 states.
[2021-06-01 15:46:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44812 to 30426.
[2021-06-01 15:46:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30426 states, 30425 states have (on average 3.9412982744453573) internal successors, (119914), 30425 states have internal predecessors, (119914), 0 states have call successors, (0), 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 15:46:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30426 states to 30426 states and 119914 transitions.
[2021-06-01 15:46:03,156 INFO L78 Accepts]: Start accepts. Automaton has 30426 states and 119914 transitions. Word has length 95
[2021-06-01 15:46:03,156 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:03,156 INFO L482 AbstractCegarLoop]: Abstraction has 30426 states and 119914 transitions.
[2021-06-01 15:46:03,156 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 0 states have call successors, (0), 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 15:46:03,156 INFO L276 IsEmpty]: Start isEmpty. Operand 30426 states and 119914 transitions.
[2021-06-01 15:46:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-06-01 15:46:03,210 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:03,210 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]
[2021-06-01 15:46:03,210 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-06-01 15:46:03,210 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:03,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:03,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1103285713, now seen corresponding path program 3 times
[2021-06-01 15:46:03,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:03,211 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580558920]
[2021-06-01 15:46:03,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:03,601 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 15:46:03,602 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:03,602 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580558920]
[2021-06-01 15:46:03,602 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580558920] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:03,602 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:03,602 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15
[2021-06-01 15:46:03,602 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162650531]
[2021-06-01 15:46:03,602 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states
[2021-06-01 15:46:03,603 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:03,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2021-06-01 15:46:03,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210
[2021-06-01 15:46:03,603 INFO L87 Difference]: Start difference. First operand 30426 states and 119914 transitions. Second operand has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 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 15:46:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:04,327 INFO L93 Difference]: Finished difference Result 56658 states and 220804 transitions.
[2021-06-01 15:46:04,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2021-06-01 15:46:04,328 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 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 95
[2021-06-01 15:46:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:04,440 INFO L225 Difference]: With dead ends: 56658
[2021-06-01 15:46:04,440 INFO L226 Difference]: Without dead ends: 44470
[2021-06-01 15:46:04,441 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 310.7ms TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342
[2021-06-01 15:46:04,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44470 states.
[2021-06-01 15:46:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44470 to 27220.
[2021-06-01 15:46:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27220 states, 27219 states have (on average 3.906021529078952) internal successors, (106318), 27219 states have internal predecessors, (106318), 0 states have call successors, (0), 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 15:46:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27220 states to 27220 states and 106318 transitions.
[2021-06-01 15:46:05,431 INFO L78 Accepts]: Start accepts. Automaton has 27220 states and 106318 transitions. Word has length 95
[2021-06-01 15:46:05,431 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:05,431 INFO L482 AbstractCegarLoop]: Abstraction has 27220 states and 106318 transitions.
[2021-06-01 15:46:05,432 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 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 15:46:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 27220 states and 106318 transitions.
[2021-06-01 15:46:05,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-06-01 15:46:05,470 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:05,471 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]
[2021-06-01 15:46:05,471 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-06-01 15:46:05,471 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:05,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:05,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1475251078, now seen corresponding path program 1 times
[2021-06-01 15:46:05,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:05,472 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121182570]
[2021-06-01 15:46:05,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:05,562 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 15:46:05,563 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:05,563 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121182570]
[2021-06-01 15:46:05,563 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121182570] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:05,563 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:05,563 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-06-01 15:46:05,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928169060]
[2021-06-01 15:46:05,563 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-06-01 15:46:05,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:05,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-06-01 15:46:05,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2021-06-01 15:46:05,564 INFO L87 Difference]: Start difference. First operand 27220 states and 106318 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 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 15:46:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:05,788 INFO L93 Difference]: Finished difference Result 41434 states and 161814 transitions.
[2021-06-01 15:46:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-06-01 15:46:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 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 95
[2021-06-01 15:46:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:05,854 INFO L225 Difference]: With dead ends: 41434
[2021-06-01 15:46:05,854 INFO L226 Difference]: Without dead ends: 26554
[2021-06-01 15:46:05,855 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 53.5ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2021-06-01 15:46:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26554 states.
[2021-06-01 15:46:06,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26554 to 25744.
[2021-06-01 15:46:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25744 states, 25743 states have (on average 3.8421318416656955) internal successors, (98908), 25743 states have internal predecessors, (98908), 0 states have call successors, (0), 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 15:46:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25744 states to 25744 states and 98908 transitions.
[2021-06-01 15:46:06,740 INFO L78 Accepts]: Start accepts. Automaton has 25744 states and 98908 transitions. Word has length 95
[2021-06-01 15:46:06,741 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:06,741 INFO L482 AbstractCegarLoop]: Abstraction has 25744 states and 98908 transitions.
[2021-06-01 15:46:06,741 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 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 15:46:06,741 INFO L276 IsEmpty]: Start isEmpty. Operand 25744 states and 98908 transitions.
[2021-06-01 15:46:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2021-06-01 15:46:06,779 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:06,779 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]
[2021-06-01 15:46:06,779 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-06-01 15:46:06,779 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1397768286, now seen corresponding path program 2 times
[2021-06-01 15:46:06,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:06,780 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117127373]
[2021-06-01 15:46:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-06-01 15:46:06,898 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:06,898 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117127373]
[2021-06-01 15:46:06,898 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117127373] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:06,898 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:06,898 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2021-06-01 15:46:06,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984928685]
[2021-06-01 15:46:06,899 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-06-01 15:46:06,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:06,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-06-01 15:46:06,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2021-06-01 15:46:06,899 INFO L87 Difference]: Start difference. First operand 25744 states and 98908 transitions. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 15:46:07,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:07,191 INFO L93 Difference]: Finished difference Result 22180 states and 84544 transitions.
[2021-06-01 15:46:07,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2021-06-01 15:46:07,191 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 95
[2021-06-01 15:46:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:07,214 INFO L225 Difference]: With dead ends: 22180
[2021-06-01 15:46:07,214 INFO L226 Difference]: Without dead ends: 8050
[2021-06-01 15:46:07,215 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 133.6ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272
[2021-06-01 15:46:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8050 states.
[2021-06-01 15:46:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8050 to 8050.
[2021-06-01 15:46:07,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8050 states, 8049 states have (on average 3.7819604919865824) internal successors, (30441), 8049 states have internal predecessors, (30441), 0 states have call successors, (0), 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 15:46:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8050 states to 8050 states and 30441 transitions.
[2021-06-01 15:46:07,400 INFO L78 Accepts]: Start accepts. Automaton has 8050 states and 30441 transitions. Word has length 95
[2021-06-01 15:46:07,400 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:07,400 INFO L482 AbstractCegarLoop]: Abstraction has 8050 states and 30441 transitions.
[2021-06-01 15:46:07,401 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 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 15:46:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 8050 states and 30441 transitions.
[2021-06-01 15:46:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2021-06-01 15:46:07,417 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:07,417 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:46:07,417 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-06-01 15:46:07,417 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:07,417 INFO L82 PathProgramCache]: Analyzing trace with hash 668293744, now seen corresponding path program 1 times
[2021-06-01 15:46:07,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:07,418 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497950478]
[2021-06-01 15:46:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-06-01 15:46:07,949 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 15:46:07,949 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-06-01 15:46:07,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497950478]
[2021-06-01 15:46:07,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497950478] provided 1 perfect and 0 imperfect interpolant sequences
[2021-06-01 15:46:07,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-06-01 15:46:07,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2021-06-01 15:46:07,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041698800]
[2021-06-01 15:46:07,950 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states
[2021-06-01 15:46:07,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-06-01 15:46:07,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2021-06-01 15:46:07,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2021-06-01 15:46:07,951 INFO L87 Difference]: Start difference. First operand 8050 states and 30441 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 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 15:46:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-06-01 15:46:08,189 INFO L93 Difference]: Finished difference Result 10810 states and 40981 transitions.
[2021-06-01 15:46:08,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2021-06-01 15:46:08,190 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 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 100
[2021-06-01 15:46:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-06-01 15:46:08,213 INFO L225 Difference]: With dead ends: 10810
[2021-06-01 15:46:08,213 INFO L226 Difference]: Without dead ends: 8464
[2021-06-01 15:46:08,213 INFO L810 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 168.1ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182
[2021-06-01 15:46:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8464 states.
[2021-06-01 15:46:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8464 to 7186.
[2021-06-01 15:46:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7186 states, 7185 states have (on average 3.7356993736951982) internal successors, (26841), 7185 states have internal predecessors, (26841), 0 states have call successors, (0), 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 15:46:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7186 states to 7186 states and 26841 transitions.
[2021-06-01 15:46:08,382 INFO L78 Accepts]: Start accepts. Automaton has 7186 states and 26841 transitions. Word has length 100
[2021-06-01 15:46:08,382 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-06-01 15:46:08,382 INFO L482 AbstractCegarLoop]: Abstraction has 7186 states and 26841 transitions.
[2021-06-01 15:46:08,383 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 0 states have call successors, (0), 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 15:46:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7186 states and 26841 transitions.
[2021-06-01 15:46:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101
[2021-06-01 15:46:08,397 INFO L546 BasicCegarLoop]: Found error trace
[2021-06-01 15:46:08,397 INFO L554 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-06-01 15:46:08,397 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-06-01 15:46:08,397 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-06-01 15:46:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-06-01 15:46:08,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1298197104, now seen corresponding path program 2 times
[2021-06-01 15:46:08,397 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-06-01 15:46:08,397 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615284911]
[2021-06-01 15:46:08,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-06-01 15:46:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 15:46:08,447 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 15:46:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-06-01 15:46:08,497 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-06-01 15:46:08,552 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-06-01 15:46:08,553 INFO L655 BasicCegarLoop]: Counterexample might be feasible
[2021-06-01 15:46:08,553 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-06-01 15:46:08,553 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3)
[2021-06-01 15:46:08,555 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2021-06-01 15:46:08,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.06 03:46:08 BasicIcfg
[2021-06-01 15:46:08,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-06-01 15:46:08,730 INFO L168 Benchmark]: Toolchain (without parser) took 158355.75 ms. Allocated memory was 346.0 MB in the beginning and 13.7 GB in the end (delta: 13.4 GB). Free memory was 307.9 MB in the beginning and 7.8 GB in the end (delta: -7.5 GB). Peak memory consumption was 5.9 GB. Max. memory is 16.0 GB.
[2021-06-01 15:46:08,730 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 346.0 MB. Free memory is still 326.1 MB. There was no memory consumed. Max. memory is 16.0 GB.
[2021-06-01 15:46:08,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.57 ms. Allocated memory is still 346.0 MB. Free memory was 307.8 MB in the beginning and 303.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB.
[2021-06-01 15:46:08,730 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.27 ms. Allocated memory is still 346.0 MB. Free memory was 303.2 MB in the beginning and 300.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
[2021-06-01 15:46:08,731 INFO L168 Benchmark]: Boogie Preprocessor took 62.62 ms. Allocated memory is still 346.0 MB. Free memory was 300.0 MB in the beginning and 296.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
[2021-06-01 15:46:08,734 INFO L168 Benchmark]: RCFGBuilder took 2258.70 ms. Allocated memory is still 346.0 MB. Free memory was 296.9 MB in the beginning and 237.5 MB in the end (delta: 59.3 MB). Peak memory consumption was 181.0 MB. Max. memory is 16.0 GB.
[2021-06-01 15:46:08,734 INFO L168 Benchmark]: TraceAbstraction took 155418.51 ms. Allocated memory was 346.0 MB in the beginning and 13.7 GB in the end (delta: 13.4 GB). Free memory was 237.5 MB in the beginning and 7.8 GB in the end (delta: -7.6 GB). Peak memory consumption was 5.8 GB. Max. memory is 16.0 GB.
[2021-06-01 15:46:08,735 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.14 ms. Allocated memory is still 346.0 MB. Free memory is still 326.1 MB. There was no memory consumed. Max. memory is 16.0 GB.
* CACSL2BoogieTranslator took 522.57 ms. Allocated memory is still 346.0 MB. Free memory was 307.8 MB in the beginning and 303.2 MB in the end (delta: 4.6 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB.
* Boogie Procedure Inliner took 85.27 ms. Allocated memory is still 346.0 MB. Free memory was 303.2 MB in the beginning and 300.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB.
* Boogie Preprocessor took 62.62 ms. Allocated memory is still 346.0 MB. Free memory was 300.0 MB in the beginning and 296.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB.
* RCFGBuilder took 2258.70 ms. Allocated memory is still 346.0 MB. Free memory was 296.9 MB in the beginning and 237.5 MB in the end (delta: 59.3 MB). Peak memory consumption was 181.0 MB. Max. memory is 16.0 GB.
* TraceAbstraction took 155418.51 ms. Allocated memory was 346.0 MB in the beginning and 13.7 GB in the end (delta: 13.4 GB). Free memory was 237.5 MB in the beginning and 7.8 GB in the end (delta: -7.6 GB). Peak memory consumption was 5.8 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 __unbuffered_p3_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0]
[L718] 0 int a = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0]
[L719] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0]
[L720] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L722] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L723] 0 _Bool x$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0]
[L724] 0 int x$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0]
[L725] 0 _Bool x$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0]
[L726] 0 _Bool x$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0]
[L727] 0 _Bool x$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0]
[L728] 0 _Bool x$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0]
[L729] 0 _Bool x$r_buff0_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0]
[L730] 0 _Bool x$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0]
[L731] 0 _Bool x$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0]
[L732] 0 _Bool x$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0]
[L733] 0 _Bool x$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0]
[L734] 0 _Bool x$r_buff1_thd4;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0]
[L735] 0 _Bool x$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0]
[L736] 0 int *x$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}]
[L737] 0 int x$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0]
[L738] 0 _Bool x$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0]
[L739] 0 int x$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0]
[L740] 0 _Bool x$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0]
[L742] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0]
[L744] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L745] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L746] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L851] 0 pthread_t t737;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L853] 0 pthread_t t738;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L770] 2 x$w_buff1 = x$w_buff0
[L771] 2 x$w_buff0 = 2
[L772] 2 x$w_buff1_used = x$w_buff0_used
[L773] 2 x$w_buff0_used = (_Bool)1
[L18] COND FALSE 2 !(!expression)
[L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4
[L780] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L783] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L855] 0 pthread_t t739;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L857] 0 pthread_t t740;
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0]
[L800] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0]
[L803] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1]
[L820] 4 z = 2
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L823] 4 __unbuffered_p3_EAX = z
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L826] 4 __unbuffered_p3_EBX = a
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x
[L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
[L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L750] 1 a = 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L753] 1 x = 1
VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x
[L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
[L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L3] COND FALSE 0 !(!cond)
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L871] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L872] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L873] 0 x$flush_delayed = weak$$choice2
[L874] 0 x$mem_tmp = x
[L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x
[L883] 0 x = x$flush_delayed ? x$mem_tmp : x
[L884] 0 x$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L18] COND TRUE 0 !expression
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
[L18] 0 reach_error()
VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=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=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2]
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P1 with 1 thread instances
CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 41434.3ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 1329.9ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 40101.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=154972occurred 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: P1Thread1of1ForFork3 with 1 thread instances
CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 40555.1ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 215.0ms, AutomataDifference: 2055.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 37942.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 115 SDtfs, 58 SDslu, 92 SDs, 0 SdLazy, 13 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=154972occurred 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: 8.2ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 11.9ms SsaConstructionTime, 61.5ms SatisfiabilityAnalysisTime, 150.0ms InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 96 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances
CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 73113.9ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 1713.4ms, AutomataDifference: 12806.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 39032.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2354 SDtfs, 3972 SDslu, 9710 SDs, 0 SdLazy, 1161 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1175.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1896.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=154972occurred in iteration=0, InterpolantAutomatonStates: 127, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 16436.6ms AutomataMinimizationTime, 12 MinimizatonAttempts, 35638 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 53.0ms SsaConstructionTime, 1009.3ms SatisfiabilityAnalysisTime, 1830.6ms InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 5896 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
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...