/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread-wmm/safe020_rmo.opt.i


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


This is Ultimate 0.2.1-bitabs-178dd20
[2021-01-06 23:35:49,827 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-01-06 23:35:49,830 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-01-06 23:35:49,871 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-01-06 23:35:49,872 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-01-06 23:35:49,874 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-01-06 23:35:49,877 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-01-06 23:35:49,880 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-01-06 23:35:49,883 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-01-06 23:35:49,884 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-01-06 23:35:49,886 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-01-06 23:35:49,887 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-01-06 23:35:49,888 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-01-06 23:35:49,889 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-01-06 23:35:49,890 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-01-06 23:35:49,892 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-01-06 23:35:49,895 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-01-06 23:35:49,897 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-01-06 23:35:49,918 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-01-06 23:35:49,922 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-01-06 23:35:49,925 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-01-06 23:35:49,927 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-01-06 23:35:49,932 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-01-06 23:35:49,937 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-01-06 23:35:49,946 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-01-06 23:35:49,946 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-01-06 23:35:49,947 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-01-06 23:35:49,951 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-01-06 23:35:49,952 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-01-06 23:35:49,955 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-01-06 23:35:49,956 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-01-06 23:35:49,957 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-01-06 23:35:49,960 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-01-06 23:35:49,961 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-01-06 23:35:49,963 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-01-06 23:35:49,963 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-01-06 23:35:49,964 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-01-06 23:35:49,964 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-01-06 23:35:49,972 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-01-06 23:35:49,974 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-01-06 23:35:49,975 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-01-06 23:35:49,977 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2021-01-06 23:35:50,047 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-01-06 23:35:50,048 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-01-06 23:35:50,055 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-01-06 23:35:50,055 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-01-06 23:35:50,056 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-01-06 23:35:50,056 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-01-06 23:35:50,057 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-01-06 23:35:50,057 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-01-06 23:35:50,057 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2021-01-06 23:35:50,058 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-01-06 23:35:50,059 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2021-01-06 23:35:50,060 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-01-06 23:35:50,060 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-01-06 23:35:50,060 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2021-01-06 23:35:50,061 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-01-06 23:35:50,061 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-01-06 23:35:50,061 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2021-01-06 23:35:50,061 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-01-06 23:35:50,062 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-01-06 23:35:50,062 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2021-01-06 23:35:50,062 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-01-06 23:35:50,062 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-01-06 23:35:50,063 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-01-06 23:35:50,063 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-01-06 23:35:50,063 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-01-06 23:35:50,063 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-bitabs/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-01-06 23:35:50,502 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-01-06 23:35:50,534 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-01-06 23:35:50,538 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-01-06 23:35:50,540 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-01-06 23:35:50,541 INFO  L275        PluginConnector]: CDTParser initialized
[2021-01-06 23:35:50,542 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe020_rmo.opt.i
[2021-01-06 23:35:50,646 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a6f87d005/4030a48732d34657945e810d6497ae39/FLAG831d778af
[2021-01-06 23:35:51,684 INFO  L306              CDTParser]: Found 1 translation units.
[2021-01-06 23:35:51,696 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe020_rmo.opt.i
[2021-01-06 23:35:51,714 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a6f87d005/4030a48732d34657945e810d6497ae39/FLAG831d778af
[2021-01-06 23:35:51,871 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/a6f87d005/4030a48732d34657945e810d6497ae39
[2021-01-06 23:35:51,876 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-01-06 23:35:51,880 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-01-06 23:35:51,883 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-01-06 23:35:51,884 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-01-06 23:35:51,888 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-01-06 23:35:51,889 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:51" (1/1) ...
[2021-01-06 23:35:51,892 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@749457c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:51, skipping insertion in model container
[2021-01-06 23:35:51,892 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:35:51" (1/1) ...
[2021-01-06 23:35:51,902 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-01-06 23:35:51,987 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-01-06 23:35:52,208 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe020_rmo.opt.i[992,1005]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$mem_tmp~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$mem_tmp~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX$read_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX$read_delayed_var~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~weak$$choice1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL]
[2021-01-06 23:35:52,477 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-01-06 23:35:52,491 INFO  L203         MainTranslator]: Completed pre-run
[2021-01-06 23:35:52,508 WARN  L226   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe020_rmo.opt.i[992,1005]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$mem_tmp~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#x~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$mem_tmp~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX$read_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX$read_delayed_var~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~weak$$choice1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL]
[2021-01-06 23:35:52,614 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-01-06 23:35:52,802 INFO  L208         MainTranslator]: Completed translation
[2021-01-06 23:35:52,803 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52 WrapperNode
[2021-01-06 23:35:52,803 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-01-06 23:35:52,807 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-01-06 23:35:52,807 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-01-06 23:35:52,808 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-01-06 23:35:52,819 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (1/1) ...
[2021-01-06 23:35:52,855 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (1/1) ...
[2021-01-06 23:35:52,888 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-01-06 23:35:52,889 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-01-06 23:35:52,890 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-01-06 23:35:52,890 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-01-06 23:35:52,905 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (1/1) ...
[2021-01-06 23:35:52,905 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (1/1) ...
[2021-01-06 23:35:52,921 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (1/1) ...
[2021-01-06 23:35:52,924 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (1/1) ...
[2021-01-06 23:35:52,964 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (1/1) ...
[2021-01-06 23:35:52,984 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (1/1) ...
[2021-01-06 23:35:52,995 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (1/1) ...
[2021-01-06 23:35:53,009 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-01-06 23:35:53,013 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-01-06 23:35:53,014 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-01-06 23:35:53,014 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-01-06 23:35:53,016 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (1/1) ...
No working directory specified, using /storage/repos/ultimate-bitabs/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-01-06 23:35:53,125 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2021-01-06 23:35:53,126 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2021-01-06 23:35:53,126 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-01-06 23:35:53,126 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-01-06 23:35:53,126 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-01-06 23:35:53,127 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2021-01-06 23:35:53,127 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2021-01-06 23:35:53,127 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2021-01-06 23:35:53,127 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2021-01-06 23:35:53,127 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2021-01-06 23:35:53,127 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2021-01-06 23:35:53,128 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-01-06 23:35:53,128 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-01-06 23:35:53,128 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-01-06 23:35:53,128 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-01-06 23:35:53,131 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2021-01-06 23:35:57,442 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-01-06 23:35:57,443 INFO  L299             CfgBuilder]: Removed 8 assume(true) statements.
[2021-01-06 23:35:57,447 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:57 BoogieIcfgContainer
[2021-01-06 23:35:57,447 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-01-06 23:35:57,450 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-01-06 23:35:57,450 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2021-01-06 23:35:57,455 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2021-01-06 23:35:57,456 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:35:51" (1/3) ...
[2021-01-06 23:35:57,458 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecb4184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:57, skipping insertion in model container
[2021-01-06 23:35:57,458 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:35:52" (2/3) ...
[2021-01-06 23:35:57,458 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecb4184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:35:57, skipping insertion in model container
[2021-01-06 23:35:57,459 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:57" (3/3) ...
[2021-01-06 23:35:57,461 INFO  L111   eAbstractionObserver]: Analyzing ICFG safe020_rmo.opt.i
[2021-01-06 23:35:57,473 WARN  L142   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-01-06 23:35:57,474 INFO  L153   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-01-06 23:35:57,482 INFO  L165   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2021-01-06 23:35:57,484 INFO  L323   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-01-06 23:35:57,552 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,553 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,553 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,553 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,554 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,554 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,554 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,554 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,555 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,555 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,555 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,555 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,555 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,555 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,556 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,556 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,556 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,556 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,556 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,556 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,557 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,557 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,557 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,557 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,557 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,558 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,558 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,558 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,558 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,558 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,559 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,560 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,560 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,560 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,560 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,560 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,561 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,561 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,561 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,561 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,561 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,562 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,562 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,562 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,562 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,563 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,563 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,566 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,566 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,567 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,568 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,568 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,568 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,568 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,568 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,568 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,569 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,569 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,569 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,569 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,570 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,570 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,570 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,570 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,570 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,570 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,571 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,572 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,572 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,572 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,572 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,572 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,572 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,573 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,573 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,573 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,573 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,573 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,574 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,574 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,574 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,577 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,578 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,578 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,578 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,579 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,579 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,579 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,579 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,580 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,580 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,580 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,580 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,581 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,581 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,581 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,582 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,582 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,582 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,582 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,583 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,583 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,584 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,584 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,584 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,584 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,584 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,585 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,585 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,585 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,585 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,586 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,587 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,587 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,587 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,588 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,588 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,588 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,589 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,589 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,589 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,589 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,590 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,590 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,590 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,590 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,591 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,591 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,591 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,591 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,591 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,591 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,592 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,592 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,592 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,592 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,592 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,593 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,593 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,593 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,593 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,593 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,593 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,594 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,594 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,594 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,594 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,594 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,594 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,595 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,595 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,595 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,595 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,595 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,595 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,595 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,596 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,596 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,596 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,596 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,596 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,597 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,597 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,597 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,597 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,597 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,598 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,601 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,601 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,601 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,601 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,602 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,602 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,602 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,602 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,602 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,602 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,602 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,603 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,603 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,603 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,603 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,603 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,603 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,604 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,604 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,604 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,604 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,604 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,604 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,605 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,605 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,605 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,605 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,605 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,605 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,606 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,606 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,606 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,606 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,606 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,606 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,607 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,607 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,607 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,607 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,607 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,607 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,608 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,608 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,608 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,612 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,612 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,612 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,613 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,613 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,613 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,613 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,613 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,613 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,614 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,615 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,615 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,615 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,615 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,615 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,615 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,616 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,616 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,617 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,618 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,618 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,618 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,622 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,623 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,623 WARN  L313   ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,624 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,625 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,625 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,666 WARN  L313   ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,675 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,676 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,676 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,676 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,676 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,676 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,677 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,677 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,677 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,677 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,677 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,678 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,678 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,678 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,678 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,678 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,679 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,679 WARN  L313   ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,679 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,679 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,679 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,679 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,680 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,680 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,680 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,680 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,680 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,681 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,681 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,681 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,681 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,681 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,681 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,682 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,682 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,682 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,682 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,682 WARN  L313   ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem63| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,686 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,686 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,687 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,687 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,687 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,687 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,687 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,687 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,688 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,688 WARN  L313   ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,688 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,688 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,689 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,689 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,689 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,689 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,690 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,690 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,690 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,690 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,690 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,691 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,691 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,691 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,691 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,691 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,692 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,692 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,692 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,692 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,692 WARN  L313   ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:35:57,694 INFO  L149    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-01-06 23:35:57,724 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2021-01-06 23:35:57,759 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2021-01-06 23:35:57,759 INFO  L378      AbstractCegarLoop]: Hoare is true
[2021-01-06 23:35:57,759 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-01-06 23:35:57,759 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-01-06 23:35:57,760 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-01-06 23:35:57,760 INFO  L382      AbstractCegarLoop]: Difference is false
[2021-01-06 23:35:57,760 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-01-06 23:35:57,760 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-01-06 23:35:57,782 INFO  L120   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-01-06 23:35:57,787 INFO  L135   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 239 flow
[2021-01-06 23:35:57,792 INFO  L110        LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 239 flow
[2021-01-06 23:35:57,796 INFO  L74            FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow
[2021-01-06 23:35:57,870 INFO  L129       PetriNetUnfolder]: 2/109 cut-off events.
[2021-01-06 23:35:57,870 INFO  L130       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-01-06 23:35:57,876 INFO  L84            FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. 
[2021-01-06 23:35:57,880 INFO  L116        LiptonReduction]: Number of co-enabled transitions 1410
[2021-01-06 23:35:58,037 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:35:58,038 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,039 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:35:58,040 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,069 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:35:58,070 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,072 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:35:58,073 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,347 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:35:58,348 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:35:58,357 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term
[2021-01-06 23:35:58,357 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:35:58,365 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term
[2021-01-06 23:35:58,369 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,375 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term
[2021-01-06 23:35:58,375 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,380 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:35:58,381 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,383 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:35:58,387 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,392 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:35:58,393 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,555 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:35:58,559 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,589 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-01-06 23:35:58,590 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,592 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2021-01-06 23:35:58,593 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,829 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:35:58,830 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:35:58,980 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:35:58,981 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:01,642 WARN  L197               SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 238 DAG size of output: 197
[2021-01-06 23:36:02,292 WARN  L197               SmtUtils]: Spent 644.00 ms on a formula simplification that was a NOOP. DAG size: 195
[2021-01-06 23:36:05,105 WARN  L197               SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 322 DAG size of output: 278
[2021-01-06 23:36:06,192 WARN  L197               SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 275
[2021-01-06 23:36:06,425 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:06,426 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:06,427 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:06,427 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:06,448 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:06,449 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:06,450 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:06,451 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:06,487 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:06,488 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:06,489 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:06,489 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:06,510 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:06,511 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:06,512 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:06,512 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:06,978 WARN  L197               SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70
[2021-01-06 23:36:07,125 WARN  L197               SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 69
[2021-01-06 23:36:07,832 WARN  L197               SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 93
[2021-01-06 23:36:08,099 WARN  L197               SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 91
[2021-01-06 23:36:08,284 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:08,284 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:08,332 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:08,333 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:08,762 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:08,762 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:08,763 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:08,763 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:08,787 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:08,787 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:08,788 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:08,788 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,208 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:09,209 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,210 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:09,210 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,294 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:09,294 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,321 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,322 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-01-06 23:36:09,326 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,326 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,389 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:09,389 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,391 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:09,391 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,392 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:09,392 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,393 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:09,393 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,394 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:09,394 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,395 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:09,395 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,397 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-01-06 23:36:09,397 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,399 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:09,399 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,401 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:09,402 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,404 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:09,404 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,406 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:09,406 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,753 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:09,753 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,902 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:09,903 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:09,946 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,947 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,948 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,948 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,950 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:36:09,950 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,951 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:36:09,951 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,960 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,960 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,962 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,963 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,964 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,964 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,966 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,967 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:09,983 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,983 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:36:09,985 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,986 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:36:09,997 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:09,998 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,000 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,000 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,002 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,002 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,077 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:10,077 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,214 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,215 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,217 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,217 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,229 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,229 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,231 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,232 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,233 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,233 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,235 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,235 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,239 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,239 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-01-06 23:36:10,241 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,241 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-01-06 23:36:10,243 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,244 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-01-06 23:36:10,249 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,249 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,253 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,254 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,255 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,256 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,612 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:10,613 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,634 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,634 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-01-06 23:36:10,637 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,638 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,684 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,684 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,691 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,692 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,692 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,693 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,694 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:10,694 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,695 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,696 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,696 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:10,696 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,698 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-01-06 23:36:10,698 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,699 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,700 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,701 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,702 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,703 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,703 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,704 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,704 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,761 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:36:10,762 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,763 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term
[2021-01-06 23:36:10,763 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,765 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term
[2021-01-06 23:36:10,765 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,766 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term
[2021-01-06 23:36:10,766 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,766 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:10,767 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,767 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:10,768 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,768 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:10,768 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,801 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-01-06 23:36:10,801 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,802 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2021-01-06 23:36:10,802 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,816 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:10,817 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,862 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:10,863 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,884 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,885 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-01-06 23:36:10,887 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:10,887 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,936 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,936 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,938 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,938 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,939 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,939 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,940 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:10,940 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,941 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,941 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,941 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:10,942 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:10,943 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-01-06 23:36:10,943 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,944 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,945 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,946 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,946 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,947 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,948 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:10,949 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:10,949 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:11,021 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:11,022 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:11,145 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:11,146 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:11,148 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:11,148 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:11,149 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:11,150 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:11,151 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:11,151 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:11,152 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:11,153 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:11,153 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:11,154 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:11,155 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-01-06 23:36:11,156 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:11,157 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:11,158 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:11,159 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:11,160 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:11,162 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:11,162 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:11,163 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:11,163 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:11,236 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:11,237 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-01-06 23:36:11,240 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:11,240 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:11,246 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:11,247 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:11,649 WARN  L197               SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 74
[2021-01-06 23:36:11,821 WARN  L197               SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 74
[2021-01-06 23:36:12,386 WARN  L197               SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 100
[2021-01-06 23:36:12,669 WARN  L197               SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 99
[2021-01-06 23:36:13,306 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:13,307 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:13,317 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term
[2021-01-06 23:36:13,318 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:13,319 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term
[2021-01-06 23:36:13,319 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:13,373 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:36:13,374 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:13,375 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term
[2021-01-06 23:36:13,375 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:13,377 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 2, 1] term
[2021-01-06 23:36:13,378 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:13,379 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 2, 2, 1] term
[2021-01-06 23:36:13,379 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:13,380 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:13,380 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:13,381 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:13,381 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:13,382 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:13,383 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:13,674 WARN  L197               SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 68
[2021-01-06 23:36:13,795 WARN  L197               SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 68
[2021-01-06 23:36:14,070 WARN  L197               SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 65
[2021-01-06 23:36:14,183 WARN  L197               SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 65
[2021-01-06 23:36:14,309 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:14,310 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,395 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,395 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,396 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,397 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,397 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,398 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,400 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,400 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,401 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,402 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,403 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,403 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,405 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,405 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,408 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,409 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-01-06 23:36:14,411 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,412 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-01-06 23:36:14,413 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,414 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts
[2021-01-06 23:36:14,417 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,418 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,422 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,422 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,424 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,425 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,508 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:14,509 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,534 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,535 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,537 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,537 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,538 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:36:14,538 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,573 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 5, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,574 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,575 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 5, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,576 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:14,582 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 3, 5, 3, 4, 3, 5, 3, 5, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,583 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:36:14,584 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 5, 3, 4, 3, 5, 3, 5, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,584 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:36:14,616 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,616 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,621 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,622 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,624 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 6, 3, 5, 3, 5, 3, 5, 3, 5, 3, 5, 3, 4, 3, 2, 1] term
[2021-01-06 23:36:14,624 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,694 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:14,695 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,696 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:14,696 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,714 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:14,715 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,716 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:14,716 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,758 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:14,758 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,800 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:36:14,801 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,858 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:14,859 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:14,859 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:14,860 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,212 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,212 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,213 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,213 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,215 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,215 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,216 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,216 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,217 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,217 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,218 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,218 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,219 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,219 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,220 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,220 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,221 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,221 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,221 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,222 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,223 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,223 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:15,224 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,225 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:15,252 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,253 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,253 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,254 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,255 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,256 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,256 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,257 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,257 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,257 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,258 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,259 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,259 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,260 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,260 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,260 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,261 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,261 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,262 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,262 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,264 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,264 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:36:15,266 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,266 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:36:15,555 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,556 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,557 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,557 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,559 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,559 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,560 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,560 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,561 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,561 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,563 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,563 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,564 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,564 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,564 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,565 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,566 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,566 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,567 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,567 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,568 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,568 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:36:15,571 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,571 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:36:15,602 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,603 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,604 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,604 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,606 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,607 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,608 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,608 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,609 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,609 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,610 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,610 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,611 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,612 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,613 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,613 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,614 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,615 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,616 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:36:15,616 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:36:15,617 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,618 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:15,620 INFO  L398       QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:36:15,620 INFO  L639       QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:36:16,141 WARN  L197               SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 73
[2021-01-06 23:36:16,274 WARN  L197               SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 73
[2021-01-06 23:36:16,523 WARN  L197               SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 73
[2021-01-06 23:36:16,738 WARN  L197               SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 81
[2021-01-06 23:36:16,882 WARN  L197               SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 79
[2021-01-06 23:36:16,993 WARN  L197               SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 73
[2021-01-06 23:36:17,114 WARN  L197               SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 73
[2021-01-06 23:36:17,236 WARN  L197               SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 73
[2021-01-06 23:36:17,351 WARN  L197               SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 73
[2021-01-06 23:36:17,913 WARN  L197               SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 105
[2021-01-06 23:36:18,094 WARN  L197               SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 101
[2021-01-06 23:36:18,333 WARN  L197               SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 105
[2021-01-06 23:36:18,525 WARN  L197               SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 101
[2021-01-06 23:36:18,960 WARN  L197               SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 151
[2021-01-06 23:36:19,347 WARN  L197               SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 147
[2021-01-06 23:36:19,750 WARN  L197               SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 151
[2021-01-06 23:36:20,196 WARN  L197               SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 147
[2021-01-06 23:36:21,199 WARN  L197               SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 158
[2021-01-06 23:36:21,639 WARN  L197               SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 154
[2021-01-06 23:36:22,570 WARN  L197               SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 158
[2021-01-06 23:36:23,025 WARN  L197               SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 154
[2021-01-06 23:36:23,031 INFO  L131        LiptonReduction]: Checked pairs total: 3906
[2021-01-06 23:36:23,031 INFO  L133        LiptonReduction]: Total number of compositions: 99
[2021-01-06 23:36:23,042 INFO  L100   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 24 transitions, 63 flow
[2021-01-06 23:36:23,096 INFO  L122   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 442 states.
[2021-01-06 23:36:23,099 INFO  L276                IsEmpty]: Start isEmpty. Operand 442 states.
[2021-01-06 23:36:23,112 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2021-01-06 23:36:23,113 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:23,114 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:23,114 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:23,120 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:23,121 INFO  L82        PathProgramCache]: Analyzing trace with hash 1749749782, now seen corresponding path program 1 times
[2021-01-06 23:36:23,131 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:23,132 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145822061]
[2021-01-06 23:36:23,132 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:23,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:23,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:23,575 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145822061]
[2021-01-06 23:36:23,575 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:23,576 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2021-01-06 23:36:23,576 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128885121]
[2021-01-06 23:36:23,588 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-01-06 23:36:23,588 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:23,609 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-01-06 23:36:23,610 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-01-06 23:36:23,612 INFO  L87              Difference]: Start difference. First operand 442 states. Second operand 3 states.
[2021-01-06 23:36:23,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:23,671 INFO  L93              Difference]: Finished difference Result 434 states and 1306 transitions.
[2021-01-06 23:36:23,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-01-06 23:36:23,674 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 9
[2021-01-06 23:36:23,674 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:23,695 INFO  L225             Difference]: With dead ends: 434
[2021-01-06 23:36:23,695 INFO  L226             Difference]: Without dead ends: 354
[2021-01-06 23:36:23,697 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-01-06 23:36:23,722 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 354 states.
[2021-01-06 23:36:23,781 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354.
[2021-01-06 23:36:23,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 354 states.
[2021-01-06 23:36:23,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1042 transitions.
[2021-01-06 23:36:23,792 INFO  L78                 Accepts]: Start accepts. Automaton has 354 states and 1042 transitions. Word has length 9
[2021-01-06 23:36:23,793 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:23,793 INFO  L481      AbstractCegarLoop]: Abstraction has 354 states and 1042 transitions.
[2021-01-06 23:36:23,794 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-01-06 23:36:23,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 354 states and 1042 transitions.
[2021-01-06 23:36:23,796 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2021-01-06 23:36:23,796 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:23,796 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:23,796 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-01-06 23:36:23,797 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:23,797 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:23,798 INFO  L82        PathProgramCache]: Analyzing trace with hash -1592332308, now seen corresponding path program 1 times
[2021-01-06 23:36:23,798 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:23,798 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858553667]
[2021-01-06 23:36:23,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:23,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:23,991 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:23,992 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858553667]
[2021-01-06 23:36:23,992 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:23,992 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-01-06 23:36:23,993 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449067462]
[2021-01-06 23:36:23,994 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-01-06 23:36:23,995 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:23,996 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-01-06 23:36:23,996 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-01-06 23:36:23,996 INFO  L87              Difference]: Start difference. First operand 354 states and 1042 transitions. Second operand 4 states.
[2021-01-06 23:36:24,031 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:24,031 INFO  L93              Difference]: Finished difference Result 342 states and 1001 transitions.
[2021-01-06 23:36:24,032 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-01-06 23:36:24,032 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 10
[2021-01-06 23:36:24,033 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:24,038 INFO  L225             Difference]: With dead ends: 342
[2021-01-06 23:36:24,038 INFO  L226             Difference]: Without dead ends: 342
[2021-01-06 23:36:24,039 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2021-01-06 23:36:24,042 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 342 states.
[2021-01-06 23:36:24,068 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342.
[2021-01-06 23:36:24,069 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 342 states.
[2021-01-06 23:36:24,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1001 transitions.
[2021-01-06 23:36:24,073 INFO  L78                 Accepts]: Start accepts. Automaton has 342 states and 1001 transitions. Word has length 10
[2021-01-06 23:36:24,073 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:24,073 INFO  L481      AbstractCegarLoop]: Abstraction has 342 states and 1001 transitions.
[2021-01-06 23:36:24,074 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-01-06 23:36:24,074 INFO  L276                IsEmpty]: Start isEmpty. Operand 342 states and 1001 transitions.
[2021-01-06 23:36:24,076 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-01-06 23:36:24,076 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:24,076 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:24,076 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-01-06 23:36:24,077 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:24,077 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:24,077 INFO  L82        PathProgramCache]: Analyzing trace with hash -2125632652, now seen corresponding path program 1 times
[2021-01-06 23:36:24,078 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:24,078 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028414387]
[2021-01-06 23:36:24,078 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:24,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:24,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:24,182 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028414387]
[2021-01-06 23:36:24,182 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:24,182 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-01-06 23:36:24,182 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550451883]
[2021-01-06 23:36:24,183 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 3 states
[2021-01-06 23:36:24,183 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:24,184 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2021-01-06 23:36:24,184 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-01-06 23:36:24,184 INFO  L87              Difference]: Start difference. First operand 342 states and 1001 transitions. Second operand 3 states.
[2021-01-06 23:36:24,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:24,204 INFO  L93              Difference]: Finished difference Result 474 states and 1332 transitions.
[2021-01-06 23:36:24,205 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2021-01-06 23:36:24,206 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 11
[2021-01-06 23:36:24,206 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:24,210 INFO  L225             Difference]: With dead ends: 474
[2021-01-06 23:36:24,210 INFO  L226             Difference]: Without dead ends: 366
[2021-01-06 23:36:24,211 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2021-01-06 23:36:24,214 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 366 states.
[2021-01-06 23:36:24,232 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 330.
[2021-01-06 23:36:24,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 330 states.
[2021-01-06 23:36:24,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 924 transitions.
[2021-01-06 23:36:24,236 INFO  L78                 Accepts]: Start accepts. Automaton has 330 states and 924 transitions. Word has length 11
[2021-01-06 23:36:24,236 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:24,236 INFO  L481      AbstractCegarLoop]: Abstraction has 330 states and 924 transitions.
[2021-01-06 23:36:24,237 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2021-01-06 23:36:24,237 INFO  L276                IsEmpty]: Start isEmpty. Operand 330 states and 924 transitions.
[2021-01-06 23:36:24,239 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-01-06 23:36:24,239 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:24,239 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:24,239 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-01-06 23:36:24,239 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:24,240 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:24,240 INFO  L82        PathProgramCache]: Analyzing trace with hash -2124517768, now seen corresponding path program 1 times
[2021-01-06 23:36:24,240 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:24,240 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674244055]
[2021-01-06 23:36:24,240 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:24,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:24,554 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:24,555 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674244055]
[2021-01-06 23:36:24,556 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:24,556 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-01-06 23:36:24,556 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140509089]
[2021-01-06 23:36:24,556 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-01-06 23:36:24,556 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:24,557 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-01-06 23:36:24,557 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2021-01-06 23:36:24,558 INFO  L87              Difference]: Start difference. First operand 330 states and 924 transitions. Second operand 6 states.
[2021-01-06 23:36:24,891 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:24,891 INFO  L93              Difference]: Finished difference Result 318 states and 883 transitions.
[2021-01-06 23:36:24,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-01-06 23:36:24,893 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 11
[2021-01-06 23:36:24,893 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:24,896 INFO  L225             Difference]: With dead ends: 318
[2021-01-06 23:36:24,896 INFO  L226             Difference]: Without dead ends: 318
[2021-01-06 23:36:24,897 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56
[2021-01-06 23:36:24,899 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 318 states.
[2021-01-06 23:36:24,910 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318.
[2021-01-06 23:36:24,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 318 states.
[2021-01-06 23:36:24,913 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 883 transitions.
[2021-01-06 23:36:24,914 INFO  L78                 Accepts]: Start accepts. Automaton has 318 states and 883 transitions. Word has length 11
[2021-01-06 23:36:24,914 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:24,914 INFO  L481      AbstractCegarLoop]: Abstraction has 318 states and 883 transitions.
[2021-01-06 23:36:24,914 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-01-06 23:36:24,914 INFO  L276                IsEmpty]: Start isEmpty. Operand 318 states and 883 transitions.
[2021-01-06 23:36:24,916 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2021-01-06 23:36:24,917 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:24,917 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:24,917 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-01-06 23:36:24,917 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:24,918 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:24,918 INFO  L82        PathProgramCache]: Analyzing trace with hash -159101646, now seen corresponding path program 1 times
[2021-01-06 23:36:24,918 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:24,919 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853385256]
[2021-01-06 23:36:24,919 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:24,988 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:25,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:25,040 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853385256]
[2021-01-06 23:36:25,041 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:25,041 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-01-06 23:36:25,041 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321119195]
[2021-01-06 23:36:25,041 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-01-06 23:36:25,042 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:25,042 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-01-06 23:36:25,043 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-01-06 23:36:25,043 INFO  L87              Difference]: Start difference. First operand 318 states and 883 transitions. Second operand 4 states.
[2021-01-06 23:36:25,085 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:25,086 INFO  L93              Difference]: Finished difference Result 314 states and 767 transitions.
[2021-01-06 23:36:25,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2021-01-06 23:36:25,087 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 12
[2021-01-06 23:36:25,087 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:25,089 INFO  L225             Difference]: With dead ends: 314
[2021-01-06 23:36:25,090 INFO  L226             Difference]: Without dead ends: 234
[2021-01-06 23:36:25,090 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2021-01-06 23:36:25,092 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 234 states.
[2021-01-06 23:36:25,098 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234.
[2021-01-06 23:36:25,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 234 states.
[2021-01-06 23:36:25,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 559 transitions.
[2021-01-06 23:36:25,101 INFO  L78                 Accepts]: Start accepts. Automaton has 234 states and 559 transitions. Word has length 12
[2021-01-06 23:36:25,101 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:25,101 INFO  L481      AbstractCegarLoop]: Abstraction has 234 states and 559 transitions.
[2021-01-06 23:36:25,102 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-01-06 23:36:25,102 INFO  L276                IsEmpty]: Start isEmpty. Operand 234 states and 559 transitions.
[2021-01-06 23:36:25,103 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2021-01-06 23:36:25,103 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:25,103 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:25,103 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-01-06 23:36:25,104 INFO  L429      AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:25,104 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:25,104 INFO  L82        PathProgramCache]: Analyzing trace with hash -1206330082, now seen corresponding path program 1 times
[2021-01-06 23:36:25,104 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:25,105 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981567584]
[2021-01-06 23:36:25,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:25,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:25,296 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:25,297 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981567584]
[2021-01-06 23:36:25,297 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:25,298 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-01-06 23:36:25,298 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785238626]
[2021-01-06 23:36:25,298 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-01-06 23:36:25,298 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:25,299 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-01-06 23:36:25,299 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-01-06 23:36:25,300 INFO  L87              Difference]: Start difference. First operand 234 states and 559 transitions. Second operand 5 states.
[2021-01-06 23:36:25,361 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:25,362 INFO  L93              Difference]: Finished difference Result 196 states and 426 transitions.
[2021-01-06 23:36:25,363 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-01-06 23:36:25,363 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 14
[2021-01-06 23:36:25,363 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:25,364 INFO  L225             Difference]: With dead ends: 196
[2021-01-06 23:36:25,364 INFO  L226             Difference]: Without dead ends: 152
[2021-01-06 23:36:25,365 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2021-01-06 23:36:25,367 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2021-01-06 23:36:25,371 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152.
[2021-01-06 23:36:25,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 152 states.
[2021-01-06 23:36:25,373 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 323 transitions.
[2021-01-06 23:36:25,373 INFO  L78                 Accepts]: Start accepts. Automaton has 152 states and 323 transitions. Word has length 14
[2021-01-06 23:36:25,373 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:25,373 INFO  L481      AbstractCegarLoop]: Abstraction has 152 states and 323 transitions.
[2021-01-06 23:36:25,373 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-01-06 23:36:25,374 INFO  L276                IsEmpty]: Start isEmpty. Operand 152 states and 323 transitions.
[2021-01-06 23:36:25,376 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-01-06 23:36:25,376 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:25,376 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:25,377 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-01-06 23:36:25,377 INFO  L429      AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:25,377 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:25,377 INFO  L82        PathProgramCache]: Analyzing trace with hash -71366117, now seen corresponding path program 1 times
[2021-01-06 23:36:25,378 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:25,379 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961762365]
[2021-01-06 23:36:25,379 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:25,467 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:25,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:25,649 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961762365]
[2021-01-06 23:36:25,649 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:25,649 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-01-06 23:36:25,649 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25402598]
[2021-01-06 23:36:25,650 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-01-06 23:36:25,650 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:25,650 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-01-06 23:36:25,651 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2021-01-06 23:36:25,651 INFO  L87              Difference]: Start difference. First operand 152 states and 323 transitions. Second operand 6 states.
[2021-01-06 23:36:25,947 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:25,948 INFO  L93              Difference]: Finished difference Result 192 states and 393 transitions.
[2021-01-06 23:36:25,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-01-06 23:36:25,949 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2021-01-06 23:36:25,949 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:25,950 INFO  L225             Difference]: With dead ends: 192
[2021-01-06 23:36:25,950 INFO  L226             Difference]: Without dead ends: 184
[2021-01-06 23:36:25,951 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2021-01-06 23:36:25,952 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2021-01-06 23:36:25,956 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 164.
[2021-01-06 23:36:25,957 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 164 states.
[2021-01-06 23:36:25,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 346 transitions.
[2021-01-06 23:36:25,958 INFO  L78                 Accepts]: Start accepts. Automaton has 164 states and 346 transitions. Word has length 16
[2021-01-06 23:36:25,959 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:25,959 INFO  L481      AbstractCegarLoop]: Abstraction has 164 states and 346 transitions.
[2021-01-06 23:36:25,959 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-01-06 23:36:25,959 INFO  L276                IsEmpty]: Start isEmpty. Operand 164 states and 346 transitions.
[2021-01-06 23:36:25,960 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-01-06 23:36:25,960 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:25,960 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:25,960 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-01-06 23:36:25,960 INFO  L429      AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:25,961 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:25,961 INFO  L82        PathProgramCache]: Analyzing trace with hash -2067364291, now seen corresponding path program 2 times
[2021-01-06 23:36:25,961 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:25,961 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218800140]
[2021-01-06 23:36:25,961 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:26,035 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:26,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:26,474 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218800140]
[2021-01-06 23:36:26,474 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:26,474 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2021-01-06 23:36:26,475 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029671500]
[2021-01-06 23:36:26,476 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 8 states
[2021-01-06 23:36:26,476 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:26,477 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2021-01-06 23:36:26,478 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2021-01-06 23:36:26,478 INFO  L87              Difference]: Start difference. First operand 164 states and 346 transitions. Second operand 8 states.
[2021-01-06 23:36:27,339 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:27,339 INFO  L93              Difference]: Finished difference Result 348 states and 713 transitions.
[2021-01-06 23:36:27,340 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2021-01-06 23:36:27,341 INFO  L78                 Accepts]: Start accepts. Automaton has 8 states. Word has length 16
[2021-01-06 23:36:27,341 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:27,353 INFO  L225             Difference]: With dead ends: 348
[2021-01-06 23:36:27,353 INFO  L226             Difference]: Without dead ends: 333
[2021-01-06 23:36:27,354 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182
[2021-01-06 23:36:27,356 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 333 states.
[2021-01-06 23:36:27,362 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 177.
[2021-01-06 23:36:27,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 177 states.
[2021-01-06 23:36:27,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 368 transitions.
[2021-01-06 23:36:27,363 INFO  L78                 Accepts]: Start accepts. Automaton has 177 states and 368 transitions. Word has length 16
[2021-01-06 23:36:27,364 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:27,364 INFO  L481      AbstractCegarLoop]: Abstraction has 177 states and 368 transitions.
[2021-01-06 23:36:27,364 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 8 states.
[2021-01-06 23:36:27,364 INFO  L276                IsEmpty]: Start isEmpty. Operand 177 states and 368 transitions.
[2021-01-06 23:36:27,365 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-01-06 23:36:27,365 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:27,365 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:27,365 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-01-06 23:36:27,365 INFO  L429      AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:27,366 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:27,366 INFO  L82        PathProgramCache]: Analyzing trace with hash -2067142951, now seen corresponding path program 3 times
[2021-01-06 23:36:27,366 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:27,366 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685235434]
[2021-01-06 23:36:27,366 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:27,463 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:27,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:27,622 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685235434]
[2021-01-06 23:36:27,622 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:27,622 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-01-06 23:36:27,623 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416070866]
[2021-01-06 23:36:27,623 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-01-06 23:36:27,623 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:27,624 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-01-06 23:36:27,624 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2021-01-06 23:36:27,624 INFO  L87              Difference]: Start difference. First operand 177 states and 368 transitions. Second operand 7 states.
[2021-01-06 23:36:28,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:28,010 INFO  L93              Difference]: Finished difference Result 281 states and 552 transitions.
[2021-01-06 23:36:28,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-01-06 23:36:28,012 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2021-01-06 23:36:28,013 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:28,015 INFO  L225             Difference]: With dead ends: 281
[2021-01-06 23:36:28,015 INFO  L226             Difference]: Without dead ends: 266
[2021-01-06 23:36:28,016 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110
[2021-01-06 23:36:28,017 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2021-01-06 23:36:28,022 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 186.
[2021-01-06 23:36:28,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 186 states.
[2021-01-06 23:36:28,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 378 transitions.
[2021-01-06 23:36:28,024 INFO  L78                 Accepts]: Start accepts. Automaton has 186 states and 378 transitions. Word has length 16
[2021-01-06 23:36:28,024 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:28,024 INFO  L481      AbstractCegarLoop]: Abstraction has 186 states and 378 transitions.
[2021-01-06 23:36:28,024 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-01-06 23:36:28,024 INFO  L276                IsEmpty]: Start isEmpty. Operand 186 states and 378 transitions.
[2021-01-06 23:36:28,025 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-01-06 23:36:28,025 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:28,025 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:28,025 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-01-06 23:36:28,025 INFO  L429      AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:28,051 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:28,052 INFO  L82        PathProgramCache]: Analyzing trace with hash 1682559147, now seen corresponding path program 4 times
[2021-01-06 23:36:28,052 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:28,052 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062003507]
[2021-01-06 23:36:28,052 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:28,120 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:28,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:28,335 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062003507]
[2021-01-06 23:36:28,335 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:28,335 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-01-06 23:36:28,336 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043892461]
[2021-01-06 23:36:28,336 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-01-06 23:36:28,336 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:28,337 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-01-06 23:36:28,337 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2021-01-06 23:36:28,337 INFO  L87              Difference]: Start difference. First operand 186 states and 378 transitions. Second operand 7 states.
[2021-01-06 23:36:28,837 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:28,837 INFO  L93              Difference]: Finished difference Result 263 states and 516 transitions.
[2021-01-06 23:36:28,838 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-01-06 23:36:28,839 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2021-01-06 23:36:28,839 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:28,841 INFO  L225             Difference]: With dead ends: 263
[2021-01-06 23:36:28,841 INFO  L226             Difference]: Without dead ends: 242
[2021-01-06 23:36:28,842 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110
[2021-01-06 23:36:28,843 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 242 states.
[2021-01-06 23:36:28,847 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 171.
[2021-01-06 23:36:28,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 171 states.
[2021-01-06 23:36:28,849 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 346 transitions.
[2021-01-06 23:36:28,849 INFO  L78                 Accepts]: Start accepts. Automaton has 171 states and 346 transitions. Word has length 16
[2021-01-06 23:36:28,849 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:28,849 INFO  L481      AbstractCegarLoop]: Abstraction has 171 states and 346 transitions.
[2021-01-06 23:36:28,849 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-01-06 23:36:28,849 INFO  L276                IsEmpty]: Start isEmpty. Operand 171 states and 346 transitions.
[2021-01-06 23:36:28,850 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-01-06 23:36:28,850 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:28,850 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:28,851 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-01-06 23:36:28,851 INFO  L429      AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:28,851 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:28,852 INFO  L82        PathProgramCache]: Analyzing trace with hash 1922509315, now seen corresponding path program 5 times
[2021-01-06 23:36:28,852 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:28,852 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887821552]
[2021-01-06 23:36:28,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:28,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:29,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:29,257 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887821552]
[2021-01-06 23:36:29,258 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:29,258 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-01-06 23:36:29,258 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731134087]
[2021-01-06 23:36:29,258 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-01-06 23:36:29,259 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:29,259 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-01-06 23:36:29,259 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2021-01-06 23:36:29,260 INFO  L87              Difference]: Start difference. First operand 171 states and 346 transitions. Second operand 7 states.
[2021-01-06 23:36:29,590 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:29,590 INFO  L93              Difference]: Finished difference Result 254 states and 492 transitions.
[2021-01-06 23:36:29,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-01-06 23:36:29,591 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2021-01-06 23:36:29,591 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:29,593 INFO  L225             Difference]: With dead ends: 254
[2021-01-06 23:36:29,593 INFO  L226             Difference]: Without dead ends: 207
[2021-01-06 23:36:29,594 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2021-01-06 23:36:29,595 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 207 states.
[2021-01-06 23:36:29,599 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 184.
[2021-01-06 23:36:29,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 184 states.
[2021-01-06 23:36:29,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 365 transitions.
[2021-01-06 23:36:29,601 INFO  L78                 Accepts]: Start accepts. Automaton has 184 states and 365 transitions. Word has length 16
[2021-01-06 23:36:29,601 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:29,601 INFO  L481      AbstractCegarLoop]: Abstraction has 184 states and 365 transitions.
[2021-01-06 23:36:29,601 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-01-06 23:36:29,601 INFO  L276                IsEmpty]: Start isEmpty. Operand 184 states and 365 transitions.
[2021-01-06 23:36:29,602 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-01-06 23:36:29,602 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:29,602 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:29,602 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2021-01-06 23:36:29,603 INFO  L429      AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:29,603 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:29,603 INFO  L82        PathProgramCache]: Analyzing trace with hash 1859003487, now seen corresponding path program 6 times
[2021-01-06 23:36:29,604 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:29,604 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788167288]
[2021-01-06 23:36:29,604 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:29,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:29,851 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:29,851 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788167288]
[2021-01-06 23:36:29,851 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:29,851 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-01-06 23:36:29,852 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73375818]
[2021-01-06 23:36:29,852 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-01-06 23:36:29,852 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:29,853 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-01-06 23:36:29,853 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2021-01-06 23:36:29,853 INFO  L87              Difference]: Start difference. First operand 184 states and 365 transitions. Second operand 6 states.
[2021-01-06 23:36:30,055 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:30,055 INFO  L93              Difference]: Finished difference Result 258 states and 507 transitions.
[2021-01-06 23:36:30,056 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-01-06 23:36:30,056 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2021-01-06 23:36:30,056 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:30,058 INFO  L225             Difference]: With dead ends: 258
[2021-01-06 23:36:30,058 INFO  L226             Difference]: Without dead ends: 179
[2021-01-06 23:36:30,058 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2021-01-06 23:36:30,059 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2021-01-06 23:36:30,063 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172.
[2021-01-06 23:36:30,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 172 states.
[2021-01-06 23:36:30,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 338 transitions.
[2021-01-06 23:36:30,064 INFO  L78                 Accepts]: Start accepts. Automaton has 172 states and 338 transitions. Word has length 16
[2021-01-06 23:36:30,065 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:30,065 INFO  L481      AbstractCegarLoop]: Abstraction has 172 states and 338 transitions.
[2021-01-06 23:36:30,065 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-01-06 23:36:30,065 INFO  L276                IsEmpty]: Start isEmpty. Operand 172 states and 338 transitions.
[2021-01-06 23:36:30,065 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-01-06 23:36:30,066 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:30,066 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:30,066 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2021-01-06 23:36:30,066 INFO  L429      AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:30,066 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:30,066 INFO  L82        PathProgramCache]: Analyzing trace with hash -299489975, now seen corresponding path program 7 times
[2021-01-06 23:36:30,067 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:30,067 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655447851]
[2021-01-06 23:36:30,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:30,110 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:30,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:30,461 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655447851]
[2021-01-06 23:36:30,461 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:30,461 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-01-06 23:36:30,461 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110532523]
[2021-01-06 23:36:30,461 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-01-06 23:36:30,461 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:30,462 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-01-06 23:36:30,462 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2021-01-06 23:36:30,462 INFO  L87              Difference]: Start difference. First operand 172 states and 338 transitions. Second operand 7 states.
[2021-01-06 23:36:30,882 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:30,882 INFO  L93              Difference]: Finished difference Result 261 states and 492 transitions.
[2021-01-06 23:36:30,883 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-01-06 23:36:30,883 INFO  L78                 Accepts]: Start accepts. Automaton has 7 states. Word has length 16
[2021-01-06 23:36:30,884 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:30,885 INFO  L225             Difference]: With dead ends: 261
[2021-01-06 23:36:30,886 INFO  L226             Difference]: Without dead ends: 224
[2021-01-06 23:36:30,886 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2021-01-06 23:36:30,887 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 224 states.
[2021-01-06 23:36:30,891 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 165.
[2021-01-06 23:36:30,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 165 states.
[2021-01-06 23:36:30,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 313 transitions.
[2021-01-06 23:36:30,892 INFO  L78                 Accepts]: Start accepts. Automaton has 165 states and 313 transitions. Word has length 16
[2021-01-06 23:36:30,892 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:30,893 INFO  L481      AbstractCegarLoop]: Abstraction has 165 states and 313 transitions.
[2021-01-06 23:36:30,893 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-01-06 23:36:30,893 INFO  L276                IsEmpty]: Start isEmpty. Operand 165 states and 313 transitions.
[2021-01-06 23:36:30,893 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2021-01-06 23:36:30,893 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:30,894 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:30,894 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2021-01-06 23:36:30,894 INFO  L429      AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:30,894 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:30,895 INFO  L82        PathProgramCache]: Analyzing trace with hash 1919859211, now seen corresponding path program 8 times
[2021-01-06 23:36:30,895 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:30,895 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597819346]
[2021-01-06 23:36:30,895 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:31,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:36:31,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-01-06 23:36:31,077 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597819346]
[2021-01-06 23:36:31,077 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:36:31,077 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-01-06 23:36:31,077 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628049386]
[2021-01-06 23:36:31,078 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-01-06 23:36:31,078 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:36:31,079 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-01-06 23:36:31,079 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-01-06 23:36:31,079 INFO  L87              Difference]: Start difference. First operand 165 states and 313 transitions. Second operand 6 states.
[2021-01-06 23:36:31,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:36:31,171 INFO  L93              Difference]: Finished difference Result 147 states and 276 transitions.
[2021-01-06 23:36:31,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2021-01-06 23:36:31,172 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 16
[2021-01-06 23:36:31,173 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:36:31,173 INFO  L225             Difference]: With dead ends: 147
[2021-01-06 23:36:31,173 INFO  L226             Difference]: Without dead ends: 41
[2021-01-06 23:36:31,174 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72
[2021-01-06 23:36:31,175 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41 states.
[2021-01-06 23:36:31,176 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41.
[2021-01-06 23:36:31,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 41 states.
[2021-01-06 23:36:31,176 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 67 transitions.
[2021-01-06 23:36:31,176 INFO  L78                 Accepts]: Start accepts. Automaton has 41 states and 67 transitions. Word has length 16
[2021-01-06 23:36:31,177 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:36:31,177 INFO  L481      AbstractCegarLoop]: Abstraction has 41 states and 67 transitions.
[2021-01-06 23:36:31,177 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-01-06 23:36:31,177 INFO  L276                IsEmpty]: Start isEmpty. Operand 41 states and 67 transitions.
[2021-01-06 23:36:31,178 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2021-01-06 23:36:31,178 INFO  L414         BasicCegarLoop]: Found error trace
[2021-01-06 23:36:31,178 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:36:31,178 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2021-01-06 23:36:31,179 INFO  L429      AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:36:31,179 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:36:31,179 INFO  L82        PathProgramCache]: Analyzing trace with hash -33875185, now seen corresponding path program 1 times
[2021-01-06 23:36:31,180 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:36:31,180 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141485335]
[2021-01-06 23:36:31,180 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:36:31,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-01-06 23:36:31,308 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-01-06 23:36:31,456 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-01-06 23:36:31,456 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-01-06 23:36:31,525 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-01-06 23:36:31,525 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2021-01-06 23:36:31,526 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2021-01-06 23:36:31,702 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:36:31 BasicIcfg
[2021-01-06 23:36:31,703 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-01-06 23:36:31,704 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-01-06 23:36:31,704 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-01-06 23:36:31,704 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-01-06 23:36:31,704 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:35:57" (3/4) ...
[2021-01-06 23:36:31,708 INFO  L131         WitnessPrinter]: Generating witness for reachability counterexample
[2021-01-06 23:36:31,897 INFO  L141         WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/safe020_rmo.opt.i-witness.graphml
[2021-01-06 23:36:31,898 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-01-06 23:36:31,899 INFO  L168              Benchmark]: Toolchain (without parser) took 40019.32 ms. Allocated memory was 153.1 MB in the beginning and 585.1 MB in the end (delta: 432.0 MB). Free memory was 126.8 MB in the beginning and 410.8 MB in the end (delta: -284.0 MB). Peak memory consumption was 149.0 MB. Max. memory is 8.0 GB.
[2021-01-06 23:36:31,900 INFO  L168              Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 153.1 MB. Free memory is still 126.0 MB. There was no memory consumed. Max. memory is 8.0 GB.
[2021-01-06 23:36:31,900 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 921.36 ms. Allocated memory is still 153.1 MB. Free memory was 126.5 MB in the beginning and 121.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 26.8 MB. Max. memory is 8.0 GB.
[2021-01-06 23:36:31,901 INFO  L168              Benchmark]: Boogie Procedure Inliner took 81.73 ms. Allocated memory is still 153.1 MB. Free memory was 121.3 MB in the beginning and 118.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
[2021-01-06 23:36:31,901 INFO  L168              Benchmark]: Boogie Preprocessor took 119.82 ms. Allocated memory is still 153.1 MB. Free memory was 118.8 MB in the beginning and 116.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
[2021-01-06 23:36:31,901 INFO  L168              Benchmark]: RCFGBuilder took 4434.18 ms. Allocated memory was 153.1 MB in the beginning and 190.8 MB in the end (delta: 37.7 MB). Free memory was 116.2 MB in the beginning and 81.9 MB in the end (delta: 34.2 MB). Peak memory consumption was 94.0 MB. Max. memory is 8.0 GB.
[2021-01-06 23:36:31,902 INFO  L168              Benchmark]: TraceAbstraction took 34253.19 ms. Allocated memory was 190.8 MB in the beginning and 585.1 MB in the end (delta: 394.3 MB). Free memory was 81.4 MB in the beginning and 433.3 MB in the end (delta: -351.9 MB). Peak memory consumption was 42.3 MB. Max. memory is 8.0 GB.
[2021-01-06 23:36:31,902 INFO  L168              Benchmark]: Witness Printer took 194.34 ms. Allocated memory is still 585.1 MB. Free memory was 433.3 MB in the beginning and 410.8 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB.
[2021-01-06 23:36:31,906 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.28 ms. Allocated memory is still 153.1 MB. Free memory is still 126.0 MB. There was no memory consumed. Max. memory is 8.0 GB.
 * CACSL2BoogieTranslator took 921.36 ms. Allocated memory is still 153.1 MB. Free memory was 126.5 MB in the beginning and 121.3 MB in the end (delta: 5.2 MB). Peak memory consumption was 26.8 MB. Max. memory is 8.0 GB.
 * Boogie Procedure Inliner took 81.73 ms. Allocated memory is still 153.1 MB. Free memory was 121.3 MB in the beginning and 118.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
 * Boogie Preprocessor took 119.82 ms. Allocated memory is still 153.1 MB. Free memory was 118.8 MB in the beginning and 116.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
 * RCFGBuilder took 4434.18 ms. Allocated memory was 153.1 MB in the beginning and 190.8 MB in the end (delta: 37.7 MB). Free memory was 116.2 MB in the beginning and 81.9 MB in the end (delta: 34.2 MB). Peak memory consumption was 94.0 MB. Max. memory is 8.0 GB.
 * TraceAbstraction took 34253.19 ms. Allocated memory was 190.8 MB in the beginning and 585.1 MB in the end (delta: 394.3 MB). Free memory was 81.4 MB in the beginning and 433.3 MB in the end (delta: -351.9 MB). Peak memory consumption was 42.3 MB. Max. memory is 8.0 GB.
 * Witness Printer took 194.34 ms. Allocated memory is still 585.1 MB. Free memory was 433.3 MB in the beginning and 410.8 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    929 VarBasedMoverChecksPositive, 67 VarBasedMoverChecksNegative, 18 SemBasedMoverChecksPositive, 49 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 4.0s, 89 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 25.2s, 120 PlacesBefore, 33 PlacesAfterwards, 112 TransitionsBefore, 24 TransitionsAfterwards, 1410 CoEnabledTransitionPairs, 8 FixpointIterations, 53 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 3906 MoverChecksTotal
  - CounterExampleResult [Line: 19]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  int __unbuffered_p2_EAX = 0;
[L715]               0  _Bool __unbuffered_p2_EAX$flush_delayed;
[L716]               0  int __unbuffered_p2_EAX$mem_tmp;
[L717]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd0;
[L718]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd1;
[L719]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd2;
[L720]               0  _Bool __unbuffered_p2_EAX$r_buff0_thd3;
[L721]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd0;
[L722]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd1;
[L723]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd2;
[L724]               0  _Bool __unbuffered_p2_EAX$r_buff1_thd3;
[L725]               0  _Bool __unbuffered_p2_EAX$read_delayed;
[L726]               0  int *__unbuffered_p2_EAX$read_delayed_var;
[L727]               0  int __unbuffered_p2_EAX$w_buff0;
[L728]               0  _Bool __unbuffered_p2_EAX$w_buff0_used;
[L729]               0  int __unbuffered_p2_EAX$w_buff1;
[L730]               0  _Bool __unbuffered_p2_EAX$w_buff1_used;
[L731]               0  _Bool main$tmp_guard0;
[L732]               0  _Bool main$tmp_guard1;
[L734]               0  int x = 0;
[L735]               0  _Bool x$flush_delayed;
[L736]               0  int x$mem_tmp;
[L737]               0  _Bool x$r_buff0_thd0;
[L738]               0  _Bool x$r_buff0_thd1;
[L739]               0  _Bool x$r_buff0_thd2;
[L740]               0  _Bool x$r_buff0_thd3;
[L741]               0  _Bool x$r_buff1_thd0;
[L742]               0  _Bool x$r_buff1_thd1;
[L743]               0  _Bool x$r_buff1_thd2;
[L744]               0  _Bool x$r_buff1_thd3;
[L745]               0  _Bool x$read_delayed;
[L746]               0  int *x$read_delayed_var;
[L747]               0  int x$w_buff0;
[L748]               0  _Bool x$w_buff0_used;
[L749]               0  int x$w_buff1;
[L750]               0  _Bool x$w_buff1_used;
[L752]               0  int y = 0;
[L753]               0  _Bool weak$$choice0;
[L754]               0  _Bool weak$$choice1;
[L755]               0  _Bool weak$$choice2;
[L849]               0  pthread_t t2272;
[L850]  FCALL, FORK  0  pthread_create(&t2272, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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]
[L851]               0  pthread_t t2273;
[L852]  FCALL, FORK  0  pthread_create(&t2273, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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]
[L853]               0  pthread_t t2274;
[L854]  FCALL, FORK  0  pthread_create(&t2274, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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]
[L806]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L807]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L808]               3  x$flush_delayed = weak$$choice2
[L809]  EXPR         3  \read(x)
[L809]               3  x$mem_tmp = x
[L810]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1)
[L810]  EXPR         3  \read(x)
[L810]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1)
[L810]               3  x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1)
[L811]  EXPR         3  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))
[L811]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)
[L811]  EXPR         3  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))
[L811]               3  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))
[L812]  EXPR         3  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))
[L812]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)
[L812]  EXPR         3  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))
[L812]               3  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))
[L813]  EXPR         3  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used))
[L813]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)
[L813]  EXPR         3  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used))
[L813]               3  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used))
[L814]  EXPR         3  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L814]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L814]  EXPR         3  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L814]               3  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L815]  EXPR         3  weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3))
[L815]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)
[L815]  EXPR         3  weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3))
[L815]               3  x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3))
[L816]  EXPR         3  weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]  EXPR         3  !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)
[L816]  EXPR         3  weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]               3  x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L817]               3  __unbuffered_p2_EAX$read_delayed = (_Bool)1
[L818]               3  __unbuffered_p2_EAX$read_delayed_var = &x
[L819]  EXPR         3  \read(x)
[L819]               3  __unbuffered_p2_EAX = x
[L820]  EXPR         3  x$flush_delayed ? x$mem_tmp : x
[L820]  EXPR         3  \read(x)
[L820]  EXPR         3  x$flush_delayed ? x$mem_tmp : x
[L820]               3  x = x$flush_delayed ? x$mem_tmp : x
[L821]               3  x$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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]
[L824]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=1]
[L827]  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)
[L827]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L827]  EXPR         3  \read(x)
[L827]  EXPR         3  x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x
[L827]  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)
[L827]               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)
[L828]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L828]               3  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L829]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L829]               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
[L830]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L830]               3  x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L831]  EXPR         3  x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
[L831]               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
[L834]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L836]               3  return 0;
[L759]               1  y = 2
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=6, weak$$choice1=0, weak$$choice2=0, x={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2]
[L764]               1  weak$$choice0 = __VERIFIER_nondet_bool()
[L765]               1  weak$$choice2 = __VERIFIER_nondet_bool()
[L766]               1  x$flush_delayed = weak$$choice2
[L767]  EXPR         1  \read(x)
[L767]               1  x$mem_tmp = x
[L768]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L768]  EXPR         1  \read(x)
[L768]  EXPR         1  !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L768]               1  x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)
[L769]  EXPR         1  weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L769]               1  x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))
[L770]  EXPR         1  weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L770]               1  x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))
[L771]  EXPR         1  weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L771]               1  x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))
[L772]  EXPR         1  weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L772]               1  x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L773]  EXPR         1  weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L773]               1  x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))
[L774]  EXPR         1  weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L774]               1  x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L775]  EXPR         1  \read(x)
[L775]               1  __unbuffered_p0_EAX = x
[L776]  EXPR         1  x$flush_delayed ? x$mem_tmp : x
[L776]               1  x = x$flush_delayed ? x$mem_tmp : x
[L777]               1  x$flush_delayed = (_Bool)0
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=255, x={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2]
[L789]               2  x = 1
        VAL             [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=2, weak$$choice1=0, weak$$choice2=255, x={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2]
[L792]  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)
[L792]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L792]  EXPR         2  \read(x)
[L792]  EXPR         2  x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x
[L792]  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)
[L792]               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)
[L793]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L793]               2  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L794]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L794]               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
[L795]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L795]               2  x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L796]  EXPR         2  x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
[L796]               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
[L782]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L784]               1  return 0;
[L799]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L801]               2  return 0;
[L856]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=0, weak$$choice2=255, x={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2]
[L4]    COND FALSE   0  !(!cond)
[L860]  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)
[L860]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L860]  EXPR         0  \read(x)
[L860]  EXPR         0  x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x
[L860]  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)
[L860]               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)
[L861]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L861]               0  x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L862]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L862]               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
[L863]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L863]               0  x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L864]  EXPR         0  x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
[L864]               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
[L867]               0  weak$$choice1 = __VERIFIER_nondet_bool()
[L868]  EXPR         0  __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L868]  EXPR         0  weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L868]  EXPR         0  \read(*__unbuffered_p2_EAX$read_delayed_var)
[L868]  EXPR         0  weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX
[L868]  EXPR         0  __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L868]               0  __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX
[L869]               0  main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1)
[L19]   COND TRUE    0  !expression
[L19]                0  reach_error()
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={7:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, 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=2, weak$$choice1=1, weak$$choice2=255, x={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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=2]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.3s, HoareTripleCheckerStatistics: 280 SDtfs, 389 SDslu, 516 SDs, 0 SdLazy, 603 SolverSat, 178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=442occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 452 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 41561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...