/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/safe009_rmo.oepc.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.1-bitabs-178dd20
[2021-01-06 23:32:35,408 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2021-01-06 23:32:35,411 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2021-01-06 23:32:35,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-01-06 23:32:35,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-01-06 23:32:35,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-01-06 23:32:35,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-01-06 23:32:35,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2021-01-06 23:32:35,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-01-06 23:32:35,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-01-06 23:32:35,496 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2021-01-06 23:32:35,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-01-06 23:32:35,498 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-01-06 23:32:35,499 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-01-06 23:32:35,502 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-01-06 23:32:35,504 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-01-06 23:32:35,505 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-01-06 23:32:35,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-01-06 23:32:35,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-01-06 23:32:35,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2021-01-06 23:32:35,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-01-06 23:32:35,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-01-06 23:32:35,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2021-01-06 23:32:35,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-01-06 23:32:35,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-01-06 23:32:35,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-01-06 23:32:35,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-01-06 23:32:35,556 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-01-06 23:32:35,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-01-06 23:32:35,557 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-01-06 23:32:35,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-01-06 23:32:35,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-01-06 23:32:35,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-01-06 23:32:35,562 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2021-01-06 23:32:35,563 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-01-06 23:32:35,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2021-01-06 23:32:35,564 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-01-06 23:32:35,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-01-06 23:32:35,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2021-01-06 23:32:35,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2021-01-06 23:32:35,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2021-01-06 23:32:35,580 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:32:35,626 INFO L113 SettingsManager]: Loading preferences was successful
[2021-01-06 23:32:35,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2021-01-06 23:32:35,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-01-06 23:32:35,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2021-01-06 23:32:35,633 INFO L138 SettingsManager]: * Use SBE=true
[2021-01-06 23:32:35,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-01-06 23:32:35,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2021-01-06 23:32:35,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2021-01-06 23:32:35,634 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2021-01-06 23:32:35,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2021-01-06 23:32:35,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2021-01-06 23:32:35,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2021-01-06 23:32:35,636 INFO L138 SettingsManager]: * Use constant arrays=true
[2021-01-06 23:32:35,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2021-01-06 23:32:35,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-01-06 23:32:35,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2021-01-06 23:32:35,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2021-01-06 23:32:35,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2021-01-06 23:32:35,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-01-06 23:32:35,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2021-01-06 23:32:35,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2021-01-06 23:32:35,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2021-01-06 23:32:35,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2021-01-06 23:32:35,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2021-01-06 23:32:35,639 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2021-01-06 23:32:35,639 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:32:36,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2021-01-06 23:32:36,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-01-06 23:32:36,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-01-06 23:32:36,068 INFO L271 PluginConnector]: Initializing CDTParser...
[2021-01-06 23:32:36,071 INFO L275 PluginConnector]: CDTParser initialized
[2021-01-06 23:32:36,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i
[2021-01-06 23:32:36,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b637964e2/61eef50413234e0d95f37c05b52cdc67/FLAG9b45ed181
[2021-01-06 23:32:36,785 INFO L306 CDTParser]: Found 1 translation units.
[2021-01-06 23:32:36,786 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i
[2021-01-06 23:32:36,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b637964e2/61eef50413234e0d95f37c05b52cdc67/FLAG9b45ed181
[2021-01-06 23:32:37,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b637964e2/61eef50413234e0d95f37c05b52cdc67
[2021-01-06 23:32:37,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-01-06 23:32:37,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements.
[2021-01-06 23:32:37,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-01-06 23:32:37,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-01-06 23:32:37,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2021-01-06 23:32:37,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:32:37" (1/1) ...
[2021-01-06 23:32:37,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f82c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37, skipping insertion in model container
[2021-01-06 23:32:37,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:32:37" (1/1) ...
[2021-01-06 23:32:37,098 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2021-01-06 23:32:37,150 INFO L178 MainTranslator]: Built tables and reachable declarations
[2021-01-06 23:32:37,335 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/safe009_rmo.oepc.i[993,1006]
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[~y$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed_var~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$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[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$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[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~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[~y$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$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_p0_EAX~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL]
[2021-01-06 23:32:37,654 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-01-06 23:32:37,664 INFO L203 MainTranslator]: Completed pre-run
[2021-01-06 23:32:37,678 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/safe009_rmo.oepc.i[993,1006]
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[~y$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX$read_delayed_var~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EAX~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd2~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd3~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$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[~#y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~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[~y$flush_delayed~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$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_p0_EAX~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL]
left hand side expression in assignment: address: IdentifierExpression[~#y~0,GLOBAL]
left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL]
[2021-01-06 23:32:37,742 INFO L206 PostProcessor]: Analyzing one entry point: main
[2021-01-06 23:32:37,899 INFO L208 MainTranslator]: Completed translation
[2021-01-06 23:32:37,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37 WrapperNode
[2021-01-06 23:32:37,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-01-06 23:32:37,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-01-06 23:32:37,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-01-06 23:32:37,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized
[2021-01-06 23:32:37,911 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:32:37" (1/1) ...
[2021-01-06 23:32:37,937 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:32:37" (1/1) ...
[2021-01-06 23:32:37,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-01-06 23:32:37,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-01-06 23:32:37,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2021-01-06 23:32:37,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2021-01-06 23:32:37,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37" (1/1) ...
[2021-01-06 23:32:37,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37" (1/1) ...
[2021-01-06 23:32:37,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37" (1/1) ...
[2021-01-06 23:32:37,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37" (1/1) ...
[2021-01-06 23:32:38,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37" (1/1) ...
[2021-01-06 23:32:38,012 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37" (1/1) ...
[2021-01-06 23:32:38,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37" (1/1) ...
[2021-01-06 23:32:38,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-01-06 23:32:38,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-01-06 23:32:38,027 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2021-01-06 23:32:38,027 INFO L275 PluginConnector]: RCFGBuilder initialized
[2021-01-06 23:32:38,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37" (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:32:38,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2021-01-06 23:32:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2021-01-06 23:32:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2021-01-06 23:32:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-01-06 23:32:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-01-06 23:32:38,150 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2021-01-06 23:32:38,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2021-01-06 23:32:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2021-01-06 23:32:38,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2021-01-06 23:32:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2021-01-06 23:32:38,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2021-01-06 23:32:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2021-01-06 23:32:38,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2021-01-06 23:32:38,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-01-06 23:32:38,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-01-06 23:32:38,154 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:32:41,141 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-01-06 23:32:41,142 INFO L299 CfgBuilder]: Removed 8 assume(true) statements.
[2021-01-06 23:32:41,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:41 BoogieIcfgContainer
[2021-01-06 23:32:41,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-01-06 23:32:41,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2021-01-06 23:32:41,146 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2021-01-06 23:32:41,149 INFO L275 PluginConnector]: TraceAbstraction initialized
[2021-01-06 23:32:41,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:32:37" (1/3) ...
[2021-01-06 23:32:41,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2195574c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:32:41, skipping insertion in model container
[2021-01-06 23:32:41,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:32:37" (2/3) ...
[2021-01-06 23:32:41,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2195574c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:32:41, skipping insertion in model container
[2021-01-06 23:32:41,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:41" (3/3) ...
[2021-01-06 23:32:41,153 INFO L111 eAbstractionObserver]: Analyzing ICFG safe009_rmo.oepc.i
[2021-01-06 23:32:41,160 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2021-01-06 23:32:41,160 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2021-01-06 23:32:41,165 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2021-01-06 23:32:41,166 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2021-01-06 23:32:41,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,212 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,212 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,212 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,213 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,213 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,214 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,215 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,216 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,226 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,227 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,228 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,232 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,232 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,232 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,233 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,233 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,233 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,237 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,238 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,238 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,239 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,243 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,246 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,246 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,247 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,247 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,248 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,250 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,251 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,251 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,252 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,252 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,253 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,254 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,255 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~mem32| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes.
[2021-01-06 23:32:41,260 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2021-01-06 23:32:41,279 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations.
[2021-01-06 23:32:41,301 INFO L377 AbstractCegarLoop]: Interprodecural is true
[2021-01-06 23:32:41,301 INFO L378 AbstractCegarLoop]: Hoare is true
[2021-01-06 23:32:41,301 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP
[2021-01-06 23:32:41,301 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2021-01-06 23:32:41,302 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-01-06 23:32:41,302 INFO L382 AbstractCegarLoop]: Difference is false
[2021-01-06 23:32:41,302 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-01-06 23:32:41,302 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2021-01-06 23:32:41,315 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2021-01-06 23:32:41,317 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 112 transitions, 239 flow
[2021-01-06 23:32:41,321 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 112 transitions, 239 flow
[2021-01-06 23:32:41,323 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow
[2021-01-06 23:32:41,377 INFO L129 PetriNetUnfolder]: 2/109 cut-off events.
[2021-01-06 23:32:41,377 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2021-01-06 23:32:41,381 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 54 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:32:41,385 INFO L116 LiptonReduction]: Number of co-enabled transitions 1418
[2021-01-06 23:32:41,740 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:41,740 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:41,743 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:41,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:41,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:41,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:41,846 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:41,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:41,852 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:41,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:41,981 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:41,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:41,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:41,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:41,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:41,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:41,987 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:41,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:41,989 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:41,990 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:41,990 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:41,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:41,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:41,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:41,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:41,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:42,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:42,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-01-06 23:32:42,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:42,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-01-06 23:32:42,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:42,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-01-06 23:32:42,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:42,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:42,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:42,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:42,016 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:42,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:42,123 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:42,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:42,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:42,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:42,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:42,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:42,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:42,131 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-01-06 23:32:42,134 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:42,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:42,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:42,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:42,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:42,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:42,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:42,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:42,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:42,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:42,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:42,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,024 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:43,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:43,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:43,105 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:43,148 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:43,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:43,149 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,232 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:43,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:43,234 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,235 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,276 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:43,277 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,278 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:43,374 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:43,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:43,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:43,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:43,378 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:43,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:43,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:43,379 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:43,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:43,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:43,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:43,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:43,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:43,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:43,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,389 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:43,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-01-06 23:32:43,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:43,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-01-06 23:32:43,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:43,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts
[2021-01-06 23:32:43,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:43,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:43,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:43,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:43,401 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:43,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:43,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:43,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:43,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:43,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:43,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:43,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-01-06 23:32:43,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:43,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:44,972 WARN L197 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 238 DAG size of output: 198
[2021-01-06 23:32:45,530 WARN L197 SmtUtils]: Spent 556.00 ms on a formula simplification that was a NOOP. DAG size: 196
[2021-01-06 23:32:47,799 WARN L197 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 322 DAG size of output: 278
[2021-01-06 23:32:48,883 WARN L197 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 275
[2021-01-06 23:32:49,267 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:49,272 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,272 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:49,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,286 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:49,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,289 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:49,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:49,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:49,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:49,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:49,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,689 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:49,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,732 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:49,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-01-06 23:32:49,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:49,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:49,773 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:49,773 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,779 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:49,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:49,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:49,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,782 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:49,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:49,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:49,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:49,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:49,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:49,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:49,788 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:32:49,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:49,789 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:32:49,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:49,790 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:32:49,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:50,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,153 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:50,153 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:50,154 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:50,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:50,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:50,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,198 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:50,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:50,200 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 4, 3, 2, 1] term
[2021-01-06 23:32:50,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts
[2021-01-06 23:32:50,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:50,323 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,391 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:50,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:50,393 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:50,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:50,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:50,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:50,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:50,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:50,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,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:32:50,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,403 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:32:50,403 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,404 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:32:50,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:50,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:50,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-01-06 23:32:50,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:50,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:50,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:50,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-01-06 23:32:50,522 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:50,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,591 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:50,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:50,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,594 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:50,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:50,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,596 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:50,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:50,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:50,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:50,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,601 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:32:50,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,602 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:32:50,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,604 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:32:50,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:50,697 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:50,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:50,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:50,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:51,090 WARN L197 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 75
[2021-01-06 23:32:51,224 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 74
[2021-01-06 23:32:51,799 WARN L197 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 98
[2021-01-06 23:32:52,061 WARN L197 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 96
[2021-01-06 23:32:52,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:52,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:52,405 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:52,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:52,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:52,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:52,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:52,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:52,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:52,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:52,413 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:52,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:52,414 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:52,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:52,416 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:52,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:52,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:52,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:52,420 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:32:52,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:52,422 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:32:52,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:52,423 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:32:52,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:52,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:52,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:52,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:52,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-01-06 23:32:52,477 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:52,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:52,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:52,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:52,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:52,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:52,981 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:52,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:53,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:53,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts
[2021-01-06 23:32:53,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term
[2021-01-06 23:32:53,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:53,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:53,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:53,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:53,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:53,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:53,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:53,049 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:53,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:53,050 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:53,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:53,051 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:53,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:53,053 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term
[2021-01-06 23:32:53,053 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:53,054 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:53,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:53,056 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:32:53,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:53,057 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:32:53,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:53,059 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:32:53,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts
[2021-01-06 23:32:53,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:53,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:53,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term
[2021-01-06 23:32:53,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:54,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:54,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:54,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:54,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:54,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term
[2021-01-06 23:32:54,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:54,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term
[2021-01-06 23:32:54,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2021-01-06 23:32:54,366 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 74
[2021-01-06 23:32:54,483 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 74
[2021-01-06 23:32:54,595 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 74
[2021-01-06 23:32:54,731 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 74
[2021-01-06 23:32:55,463 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 99
[2021-01-06 23:32:55,622 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 95
[2021-01-06 23:32:55,797 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 99
[2021-01-06 23:32:55,957 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 95
[2021-01-06 23:32:56,825 WARN L197 SmtUtils]: Spent 863.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 158
[2021-01-06 23:32:57,231 WARN L197 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 154
[2021-01-06 23:32:58,157 WARN L197 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 158
[2021-01-06 23:32:58,553 WARN L197 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 154
[2021-01-06 23:32:58,558 INFO L131 LiptonReduction]: Checked pairs total: 3527
[2021-01-06 23:32:58,558 INFO L133 LiptonReduction]: Total number of compositions: 96
[2021-01-06 23:32:58,565 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow
[2021-01-06 23:32:58,603 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 530 states.
[2021-01-06 23:32:58,605 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states.
[2021-01-06 23:32:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9
[2021-01-06 23:32:58,614 INFO L414 BasicCegarLoop]: Found error trace
[2021-01-06 23:32:58,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:32:58,615 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:32:58,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:32:58,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1389358799, now seen corresponding path program 1 times
[2021-01-06 23:32:58,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:32:58,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531026649]
[2021-01-06 23:32:58,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:32:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:32:58,941 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:32:58,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531026649]
[2021-01-06 23:32:58,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:32:58,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-01-06 23:32:58,945 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43728028]
[2021-01-06 23:32:58,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states
[2021-01-06 23:32:58,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:32:58,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2021-01-06 23:32:58,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2021-01-06 23:32:58,970 INFO L87 Difference]: Start difference. First operand 530 states. Second operand 2 states.
[2021-01-06 23:32:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:32:59,028 INFO L93 Difference]: Finished difference Result 530 states and 1622 transitions.
[2021-01-06 23:32:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2021-01-06 23:32:59,029 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8
[2021-01-06 23:32:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:32:59,048 INFO L225 Difference]: With dead ends: 530
[2021-01-06 23:32:59,048 INFO L226 Difference]: Without dead ends: 450
[2021-01-06 23:32:59,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2021-01-06 23:32:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states.
[2021-01-06 23:32:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450.
[2021-01-06 23:32:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states.
[2021-01-06 23:32:59,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions.
[2021-01-06 23:32:59,143 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 8
[2021-01-06 23:32:59,144 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:32:59,144 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions.
[2021-01-06 23:32:59,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2021-01-06 23:32:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions.
[2021-01-06 23:32:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2021-01-06 23:32:59,146 INFO L414 BasicCegarLoop]: Found error trace
[2021-01-06 23:32:59,146 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:32:59,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2021-01-06 23:32:59,147 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:32:59,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:32:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash -562599527, now seen corresponding path program 1 times
[2021-01-06 23:32:59,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:32:59,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158777238]
[2021-01-06 23:32:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:32:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:32:59,438 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:32:59,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158777238]
[2021-01-06 23:32:59,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:32:59,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-01-06 23:32:59,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005964538]
[2021-01-06 23:32:59,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-01-06 23:32:59,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:32:59,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-01-06 23:32:59,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-01-06 23:32:59,442 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 5 states.
[2021-01-06 23:32:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:32:59,496 INFO L93 Difference]: Finished difference Result 498 states and 1446 transitions.
[2021-01-06 23:32:59,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-01-06 23:32:59,497 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10
[2021-01-06 23:32:59,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:32:59,502 INFO L225 Difference]: With dead ends: 498
[2021-01-06 23:32:59,502 INFO L226 Difference]: Without dead ends: 418
[2021-01-06 23:32:59,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2021-01-06 23:32:59,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states.
[2021-01-06 23:32:59,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418.
[2021-01-06 23:32:59,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states.
[2021-01-06 23:32:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1246 transitions.
[2021-01-06 23:32:59,540 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1246 transitions. Word has length 10
[2021-01-06 23:32:59,541 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:32:59,541 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 1246 transitions.
[2021-01-06 23:32:59,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-01-06 23:32:59,541 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1246 transitions.
[2021-01-06 23:32:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2021-01-06 23:32:59,543 INFO L414 BasicCegarLoop]: Found error trace
[2021-01-06 23:32:59,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:32:59,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2021-01-06 23:32:59,544 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:32:59,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:32:59,545 INFO L82 PathProgramCache]: Analyzing trace with hash -122653245, now seen corresponding path program 1 times
[2021-01-06 23:32:59,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:32:59,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352338929]
[2021-01-06 23:32:59,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:32:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:32:59,806 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:32:59,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352338929]
[2021-01-06 23:32:59,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:32:59,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-01-06 23:32:59,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928612284]
[2021-01-06 23:32:59,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-01-06 23:32:59,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:32:59,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-01-06 23:32:59,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-01-06 23:32:59,809 INFO L87 Difference]: Start difference. First operand 418 states and 1246 transitions. Second operand 5 states.
[2021-01-06 23:32:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:32:59,876 INFO L93 Difference]: Finished difference Result 530 states and 1522 transitions.
[2021-01-06 23:32:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-01-06 23:32:59,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11
[2021-01-06 23:32:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:32:59,879 INFO L225 Difference]: With dead ends: 530
[2021-01-06 23:32:59,879 INFO L226 Difference]: Without dead ends: 242
[2021-01-06 23:32:59,880 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2021-01-06 23:32:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states.
[2021-01-06 23:32:59,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242.
[2021-01-06 23:32:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states.
[2021-01-06 23:32:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 646 transitions.
[2021-01-06 23:32:59,892 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 646 transitions. Word has length 11
[2021-01-06 23:32:59,892 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:32:59,892 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 646 transitions.
[2021-01-06 23:32:59,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-01-06 23:32:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 646 transitions.
[2021-01-06 23:32:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2021-01-06 23:32:59,894 INFO L414 BasicCegarLoop]: Found error trace
[2021-01-06 23:32:59,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:32:59,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2021-01-06 23:32:59,895 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:32:59,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:32:59,895 INFO L82 PathProgramCache]: Analyzing trace with hash 119475071, now seen corresponding path program 1 times
[2021-01-06 23:32:59,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:32:59,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962834190]
[2021-01-06 23:32:59,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:33:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:33:00,364 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:33:00,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962834190]
[2021-01-06 23:33:00,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:33:00,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-01-06 23:33:00,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657134015]
[2021-01-06 23:33:00,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-01-06 23:33:00,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:33:00,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-01-06 23:33:00,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-01-06 23:33:00,367 INFO L87 Difference]: Start difference. First operand 242 states and 646 transitions. Second operand 6 states.
[2021-01-06 23:33:00,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:33:00,527 INFO L93 Difference]: Finished difference Result 270 states and 698 transitions.
[2021-01-06 23:33:00,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-01-06 23:33:00,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13
[2021-01-06 23:33:00,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:33:00,530 INFO L225 Difference]: With dead ends: 270
[2021-01-06 23:33:00,531 INFO L226 Difference]: Without dead ends: 238
[2021-01-06 23:33:00,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2021-01-06 23:33:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states.
[2021-01-06 23:33:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238.
[2021-01-06 23:33:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states.
[2021-01-06 23:33:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 632 transitions.
[2021-01-06 23:33:00,540 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 632 transitions. Word has length 13
[2021-01-06 23:33:00,540 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:33:00,540 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 632 transitions.
[2021-01-06 23:33:00,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-01-06 23:33:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 632 transitions.
[2021-01-06 23:33:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2021-01-06 23:33:00,542 INFO L414 BasicCegarLoop]: Found error trace
[2021-01-06 23:33:00,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:33:00,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2021-01-06 23:33:00,543 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:33:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:33:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash -103680915, now seen corresponding path program 1 times
[2021-01-06 23:33:00,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:33:00,544 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70868417]
[2021-01-06 23:33:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:33:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:33:00,854 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:33:00,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70868417]
[2021-01-06 23:33:00,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:33:00,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-01-06 23:33:00,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915420334]
[2021-01-06 23:33:00,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states
[2021-01-06 23:33:00,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:33:00,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2021-01-06 23:33:00,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2021-01-06 23:33:00,857 INFO L87 Difference]: Start difference. First operand 238 states and 632 transitions. Second operand 7 states.
[2021-01-06 23:33:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:33:01,088 INFO L93 Difference]: Finished difference Result 294 states and 768 transitions.
[2021-01-06 23:33:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-01-06 23:33:01,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14
[2021-01-06 23:33:01,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:33:01,091 INFO L225 Difference]: With dead ends: 294
[2021-01-06 23:33:01,091 INFO L226 Difference]: Without dead ends: 264
[2021-01-06 23:33:01,092 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2021-01-06 23:33:01,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states.
[2021-01-06 23:33:01,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 252.
[2021-01-06 23:33:01,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states.
[2021-01-06 23:33:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 669 transitions.
[2021-01-06 23:33:01,102 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 669 transitions. Word has length 14
[2021-01-06 23:33:01,102 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:33:01,102 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 669 transitions.
[2021-01-06 23:33:01,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2021-01-06 23:33:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 669 transitions.
[2021-01-06 23:33:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2021-01-06 23:33:01,104 INFO L414 BasicCegarLoop]: Found error trace
[2021-01-06 23:33:01,104 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:33:01,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2021-01-06 23:33:01,104 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:33:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:33:01,105 INFO L82 PathProgramCache]: Analyzing trace with hash -591161842, now seen corresponding path program 1 times
[2021-01-06 23:33:01,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:33:01,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301764225]
[2021-01-06 23:33:01,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:33:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:33:01,216 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:33:01,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301764225]
[2021-01-06 23:33:01,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:33:01,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2021-01-06 23:33:01,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336300075]
[2021-01-06 23:33:01,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states
[2021-01-06 23:33:01,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:33:01,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2021-01-06 23:33:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2021-01-06 23:33:01,219 INFO L87 Difference]: Start difference. First operand 252 states and 669 transitions. Second operand 4 states.
[2021-01-06 23:33:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:33:01,245 INFO L93 Difference]: Finished difference Result 252 states and 594 transitions.
[2021-01-06 23:33:01,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2021-01-06 23:33:01,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2021-01-06 23:33:01,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:33:01,247 INFO L225 Difference]: With dead ends: 252
[2021-01-06 23:33:01,247 INFO L226 Difference]: Without dead ends: 198
[2021-01-06 23:33:01,248 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:33:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2021-01-06 23:33:01,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198.
[2021-01-06 23:33:01,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states.
[2021-01-06 23:33:01,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 465 transitions.
[2021-01-06 23:33:01,255 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 465 transitions. Word has length 14
[2021-01-06 23:33:01,255 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:33:01,255 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 465 transitions.
[2021-01-06 23:33:01,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2021-01-06 23:33:01,255 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 465 transitions.
[2021-01-06 23:33:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2021-01-06 23:33:01,256 INFO L414 BasicCegarLoop]: Found error trace
[2021-01-06 23:33:01,256 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:33:01,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2021-01-06 23:33:01,257 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:33:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:33:01,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1068552522, now seen corresponding path program 1 times
[2021-01-06 23:33:01,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:33:01,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548479872]
[2021-01-06 23:33:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:33:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:33:01,362 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:33:01,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548479872]
[2021-01-06 23:33:01,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:33:01,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2021-01-06 23:33:01,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793188967]
[2021-01-06 23:33:01,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states
[2021-01-06 23:33:01,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:33:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-01-06 23:33:01,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-01-06 23:33:01,365 INFO L87 Difference]: Start difference. First operand 198 states and 465 transitions. Second operand 5 states.
[2021-01-06 23:33:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:33:01,406 INFO L93 Difference]: Finished difference Result 158 states and 326 transitions.
[2021-01-06 23:33:01,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2021-01-06 23:33:01,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15
[2021-01-06 23:33:01,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:33:01,408 INFO L225 Difference]: With dead ends: 158
[2021-01-06 23:33:01,408 INFO L226 Difference]: Without dead ends: 124
[2021-01-06 23:33:01,409 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:33:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2021-01-06 23:33:01,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122.
[2021-01-06 23:33:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states.
[2021-01-06 23:33:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 242 transitions.
[2021-01-06 23:33:01,414 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 242 transitions. Word has length 15
[2021-01-06 23:33:01,414 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:33:01,414 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 242 transitions.
[2021-01-06 23:33:01,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2021-01-06 23:33:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 242 transitions.
[2021-01-06 23:33:01,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-01-06 23:33:01,415 INFO L414 BasicCegarLoop]: Found error trace
[2021-01-06 23:33:01,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:33:01,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2021-01-06 23:33:01,415 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:33:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:33:01,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1130921409, now seen corresponding path program 1 times
[2021-01-06 23:33:01,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:33:01,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277467529]
[2021-01-06 23:33:01,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:33:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:33:01,899 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:33:01,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277467529]
[2021-01-06 23:33:01,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:33:01,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2021-01-06 23:33:01,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066757636]
[2021-01-06 23:33:01,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states
[2021-01-06 23:33:01,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:33:01,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2021-01-06 23:33:01,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2021-01-06 23:33:01,901 INFO L87 Difference]: Start difference. First operand 122 states and 242 transitions. Second operand 9 states.
[2021-01-06 23:33:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:33:02,128 INFO L93 Difference]: Finished difference Result 205 states and 405 transitions.
[2021-01-06 23:33:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2021-01-06 23:33:02,129 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17
[2021-01-06 23:33:02,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:33:02,131 INFO L225 Difference]: With dead ends: 205
[2021-01-06 23:33:02,131 INFO L226 Difference]: Without dead ends: 177
[2021-01-06 23:33:02,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2021-01-06 23:33:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2021-01-06 23:33:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 147.
[2021-01-06 23:33:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states.
[2021-01-06 23:33:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 289 transitions.
[2021-01-06 23:33:02,137 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 289 transitions. Word has length 17
[2021-01-06 23:33:02,137 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:33:02,137 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 289 transitions.
[2021-01-06 23:33:02,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2021-01-06 23:33:02,137 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 289 transitions.
[2021-01-06 23:33:02,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2021-01-06 23:33:02,138 INFO L414 BasicCegarLoop]: Found error trace
[2021-01-06 23:33:02,138 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:33:02,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2021-01-06 23:33:02,139 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:33:02,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:33:02,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1997483111, now seen corresponding path program 1 times
[2021-01-06 23:33:02,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:33:02,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300953032]
[2021-01-06 23:33:02,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:33:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-01-06 23:33:02,274 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:33:02,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300953032]
[2021-01-06 23:33:02,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-01-06 23:33:02,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-01-06 23:33:02,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446317992]
[2021-01-06 23:33:02,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states
[2021-01-06 23:33:02,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-01-06 23:33:02,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2021-01-06 23:33:02,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2021-01-06 23:33:02,277 INFO L87 Difference]: Start difference. First operand 147 states and 289 transitions. Second operand 6 states.
[2021-01-06 23:33:02,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-01-06 23:33:02,334 INFO L93 Difference]: Finished difference Result 124 states and 241 transitions.
[2021-01-06 23:33:02,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2021-01-06 23:33:02,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17
[2021-01-06 23:33:02,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2021-01-06 23:33:02,336 INFO L225 Difference]: With dead ends: 124
[2021-01-06 23:33:02,336 INFO L226 Difference]: Without dead ends: 101
[2021-01-06 23:33:02,337 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:33:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2021-01-06 23:33:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91.
[2021-01-06 23:33:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2021-01-06 23:33:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 177 transitions.
[2021-01-06 23:33:02,340 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 177 transitions. Word has length 17
[2021-01-06 23:33:02,340 INFO L84 Accepts]: Finished accepts. word is rejected.
[2021-01-06 23:33:02,340 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 177 transitions.
[2021-01-06 23:33:02,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states.
[2021-01-06 23:33:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 177 transitions.
[2021-01-06 23:33:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2021-01-06 23:33:02,341 INFO L414 BasicCegarLoop]: Found error trace
[2021-01-06 23:33:02,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2021-01-06 23:33:02,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2021-01-06 23:33:02,342 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2021-01-06 23:33:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2021-01-06 23:33:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1086407887, now seen corresponding path program 1 times
[2021-01-06 23:33:02,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-01-06 23:33:02,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670414586]
[2021-01-06 23:33:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-01-06 23:33:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-01-06 23:33:02,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-01-06 23:33:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-01-06 23:33:02,564 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-01-06 23:33:02,628 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-01-06 23:33:02,628 INFO L523 BasicCegarLoop]: Counterexample might be feasible
[2021-01-06 23:33:02,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2021-01-06 23:33:02,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:33:02 BasicIcfg
[2021-01-06 23:33:02,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2021-01-06 23:33:02,797 INFO L113 PluginConnector]: ------------------------Witness Printer----------------------------
[2021-01-06 23:33:02,797 INFO L271 PluginConnector]: Initializing Witness Printer...
[2021-01-06 23:33:02,797 INFO L275 PluginConnector]: Witness Printer initialized
[2021-01-06 23:33:02,798 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:32:41" (3/4) ...
[2021-01-06 23:33:02,800 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample
[2021-01-06 23:33:02,984 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/safe009_rmo.oepc.i-witness.graphml
[2021-01-06 23:33:02,984 INFO L132 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-01-06 23:33:02,985 INFO L168 Benchmark]: Toolchain (without parser) took 25904.47 ms. Allocated memory was 155.2 MB in the beginning and 449.8 MB in the end (delta: 294.6 MB). Free memory was 127.9 MB in the beginning and 262.3 MB in the end (delta: -134.4 MB). Peak memory consumption was 162.5 MB. Max. memory is 8.0 GB.
[2021-01-06 23:33:02,985 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 155.2 MB. Free memory is still 128.7 MB. There was no memory consumed. Max. memory is 8.0 GB.
[2021-01-06 23:33:02,985 INFO L168 Benchmark]: CACSL2BoogieTranslator took 818.79 ms. Allocated memory is still 155.2 MB. Free memory was 127.7 MB in the beginning and 127.3 MB in the end (delta: 435.2 kB). Peak memory consumption was 33.3 MB. Max. memory is 8.0 GB.
[2021-01-06 23:33:02,986 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.47 ms. Allocated memory is still 155.2 MB. Free memory was 127.3 MB in the beginning and 124.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
[2021-01-06 23:33:02,987 INFO L168 Benchmark]: Boogie Preprocessor took 51.52 ms. Allocated memory is still 155.2 MB. Free memory was 124.7 MB in the beginning and 122.0 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:33:02,988 INFO L168 Benchmark]: RCFGBuilder took 3117.78 ms. Allocated memory was 155.2 MB in the beginning and 196.1 MB in the end (delta: 40.9 MB). Free memory was 122.0 MB in the beginning and 104.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 101.4 MB. Max. memory is 8.0 GB.
[2021-01-06 23:33:02,988 INFO L168 Benchmark]: TraceAbstraction took 21650.52 ms. Allocated memory was 196.1 MB in the beginning and 449.8 MB in the end (delta: 253.8 MB). Free memory was 104.0 MB in the beginning and 283.3 MB in the end (delta: -179.3 MB). Peak memory consumption was 74.9 MB. Max. memory is 8.0 GB.
[2021-01-06 23:33:02,989 INFO L168 Benchmark]: Witness Printer took 186.86 ms. Allocated memory is still 449.8 MB. Free memory was 283.3 MB in the beginning and 262.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB.
[2021-01-06 23:33:02,991 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.18 ms. Allocated memory is still 155.2 MB. Free memory is still 128.7 MB. There was no memory consumed. Max. memory is 8.0 GB.
* CACSL2BoogieTranslator took 818.79 ms. Allocated memory is still 155.2 MB. Free memory was 127.7 MB in the beginning and 127.3 MB in the end (delta: 435.2 kB). Peak memory consumption was 33.3 MB. Max. memory is 8.0 GB.
* Boogie Procedure Inliner took 71.47 ms. Allocated memory is still 155.2 MB. Free memory was 127.3 MB in the beginning and 124.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB.
* Boogie Preprocessor took 51.52 ms. Allocated memory is still 155.2 MB. Free memory was 124.7 MB in the beginning and 122.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
* RCFGBuilder took 3117.78 ms. Allocated memory was 155.2 MB in the beginning and 196.1 MB in the end (delta: 40.9 MB). Free memory was 122.0 MB in the beginning and 104.5 MB in the end (delta: 17.5 MB). Peak memory consumption was 101.4 MB. Max. memory is 8.0 GB.
* TraceAbstraction took 21650.52 ms. Allocated memory was 196.1 MB in the beginning and 449.8 MB in the end (delta: 253.8 MB). Free memory was 104.0 MB in the beginning and 283.3 MB in the end (delta: -179.3 MB). Peak memory consumption was 74.9 MB. Max. memory is 8.0 GB.
* Witness Printer took 186.86 ms. Allocated memory is still 449.8 MB. Free memory was 283.3 MB in the beginning and 262.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
818 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 13 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.8s, 76 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 17.2s, 120 PlacesBefore, 34 PlacesAfterwards, 112 TransitionsBefore, 25 TransitionsAfterwards, 1418 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 3527 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;
[L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed;
[L714] 0 int __unbuffered_p0_EAX$mem_tmp;
[L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0;
[L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1;
[L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2;
[L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3;
[L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0;
[L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1;
[L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2;
[L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3;
[L723] 0 _Bool __unbuffered_p0_EAX$read_delayed;
[L724] 0 int *__unbuffered_p0_EAX$read_delayed_var;
[L725] 0 int __unbuffered_p0_EAX$w_buff0;
[L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used;
[L727] 0 int __unbuffered_p0_EAX$w_buff1;
[L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used;
[L730] 0 int __unbuffered_p1_EAX = 0;
[L731] 0 _Bool main$tmp_guard0;
[L732] 0 _Bool main$tmp_guard1;
[L734] 0 int x = 0;
[L736] 0 int y = 0;
[L737] 0 _Bool y$flush_delayed;
[L738] 0 int y$mem_tmp;
[L739] 0 _Bool y$r_buff0_thd0;
[L740] 0 _Bool y$r_buff0_thd1;
[L741] 0 _Bool y$r_buff0_thd2;
[L742] 0 _Bool y$r_buff0_thd3;
[L743] 0 _Bool y$r_buff1_thd0;
[L744] 0 _Bool y$r_buff1_thd1;
[L745] 0 _Bool y$r_buff1_thd2;
[L746] 0 _Bool y$r_buff1_thd3;
[L747] 0 _Bool y$read_delayed;
[L748] 0 int *y$read_delayed_var;
[L749] 0 int y$w_buff0;
[L750] 0 _Bool y$w_buff0_used;
[L751] 0 int y$w_buff1;
[L752] 0 _Bool y$w_buff1_used;
[L753] 0 _Bool weak$$choice0;
[L754] 0 _Bool weak$$choice1;
[L755] 0 _Bool weak$$choice2;
[L834] 0 pthread_t t1997;
[L835] FCALL, FORK 0 pthread_create(&t1997, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L759] 1 weak$$choice0 = __VERIFIER_nondet_bool()
[L760] 1 weak$$choice2 = __VERIFIER_nondet_bool()
[L761] 1 y$flush_delayed = weak$$choice2
[L762] EXPR 1 \read(y)
[L762] 1 y$mem_tmp = y
[L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L763] EXPR 1 \read(y)
[L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)
[L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)
[L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))
[L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)
[L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))
[L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L766] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)
[L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))
[L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L767] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)
[L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))
[L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L769] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)
[L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))
[L770] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1
[L771] 1 __unbuffered_p0_EAX$read_delayed_var = &y
[L772] EXPR 1 \read(y)
[L772] 1 __unbuffered_p0_EAX = y
[L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L773] EXPR 1 \read(y)
[L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y
[L773] 1 y = y$flush_delayed ? y$mem_tmp : y
[L774] 1 y$flush_delayed = (_Bool)0
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L777] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L836] 0 pthread_t t1998;
[L837] FCALL, FORK 0 pthread_create(&t1998, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L789] 2 __unbuffered_p1_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L792] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L795] EXPR 2 \read(y)
[L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y
[L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L796] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L797] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L798] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
[L838] 0 pthread_t t1999;
[L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L804] 2 return 0;
[L839] FCALL, FORK 0 pthread_create(&t1999, ((void *)0), P2, ((void *)0))
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, 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=5, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L809] 3 y = 2
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L812] EXPR 3 \read(y)
[L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y
[L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L813] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L816] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
[L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L821] 3 return 0;
[L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L784] 1 return 0;
[L841] 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_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[L4] COND FALSE 0 !(!cond)
[L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L845] EXPR 0 \read(y)
[L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y
[L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L845] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L846] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L847] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L847] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L849] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L849] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
[L852] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L853] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L854] 0 y$flush_delayed = weak$$choice2
[L855] EXPR 0 \read(y)
[L855] 0 y$mem_tmp = y
[L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L856] EXPR 0 \read(y)
[L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L856] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L857] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L857] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L858] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L858] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L859] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L859] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L860] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L860] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L861] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L861] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L862] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L862] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L863] 0 weak$$choice1 = __VERIFIER_nondet_bool()
[L864] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L864] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L864] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var)
[L864] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX
[L864] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L864] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX
[L865] EXPR 0 \read(y)
[L865] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1)
[L866] EXPR 0 y$flush_delayed ? y$mem_tmp : y
[L866] 0 y = y$flush_delayed ? y$mem_tmp : y
[L867] 0 y$flush_delayed = (_Bool)0
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
[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=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.3s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 17.3s, HoareTripleCheckerStatistics: 187 SDtfs, 289 SDslu, 361 SDs, 0 SdLazy, 275 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=530occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 54 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 139 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 19766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...