/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/mix040_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 23:21:45,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 23:21:45,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 23:21:45,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 23:21:45,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 23:21:45,230 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 23:21:45,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 23:21:45,234 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 23:21:45,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 23:21:45,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 23:21:45,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 23:21:45,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 23:21:45,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 23:21:45,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 23:21:45,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 23:21:45,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 23:21:45,257 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 23:21:45,258 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 23:21:45,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 23:21:45,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 23:21:45,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 23:21:45,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 23:21:45,268 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 23:21:45,269 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 23:21:45,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 23:21:45,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 23:21:45,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 23:21:45,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 23:21:45,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 23:21:45,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 23:21:45,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 23:21:45,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 23:21:45,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 23:21:45,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 23:21:45,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 23:21:45,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 23:21:45,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 23:21:45,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 23:21:45,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 23:21:45,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 23:21:45,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 23:21:45,286 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:21:45,312 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 23:21:45,312 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 23:21:45,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 23:21:45,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 23:21:45,314 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 23:21:45,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 23:21:45,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 23:21:45,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 23:21:45,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 23:21:45,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 23:21:45,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 23:21:45,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 23:21:45,317 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 23:21:45,317 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 23:21:45,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 23:21:45,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 23:21:45,318 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 23:21:45,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:21:45,318 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 23:21:45,318 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 23:21:45,319 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 23:21:45,319 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 23:21:45,319 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 23:21:45,319 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 23:21:45,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 23:21:45,320 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:21:45,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 23:21:45,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 23:21:45,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 23:21:45,716 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 23:21:45,717 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 23:21:45,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix040_power.oepc.i [2021-01-06 23:21:45,808 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/94976a665/e139cc9f4d7f47ca889752ef424dbc4a/FLAGdd1ef007b [2021-01-06 23:21:46,527 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 23:21:46,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix040_power.oepc.i [2021-01-06 23:21:46,555 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/94976a665/e139cc9f4d7f47ca889752ef424dbc4a/FLAGdd1ef007b [2021-01-06 23:21:46,814 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/94976a665/e139cc9f4d7f47ca889752ef424dbc4a [2021-01-06 23:21:46,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 23:21:46,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 23:21:46,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 23:21:46,829 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 23:21:46,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 23:21:46,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:21:46" (1/1) ... [2021-01-06 23:21:46,836 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e9b34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:46, skipping insertion in model container [2021-01-06 23:21:46,836 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:21:46" (1/1) ... [2021-01-06 23:21:46,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 23:21:46,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 23:21:47,062 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/mix040_power.oepc.i[951,964] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$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[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$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[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~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[~b$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~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[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2021-01-06 23:21:47,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:21:47,315 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 23:21:47,330 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/mix040_power.oepc.i[951,964] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$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[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$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[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~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[~b$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd4~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[~b~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~b$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2021-01-06 23:21:47,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:21:47,560 INFO L208 MainTranslator]: Completed translation [2021-01-06 23:21:47,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:47 WrapperNode [2021-01-06 23:21:47,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 23:21:47,562 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 23:21:47,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 23:21:47,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 23:21:47,571 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:21:47" (1/1) ... [2021-01-06 23:21:47,591 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:21:47" (1/1) ... [2021-01-06 23:21:47,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 23:21:47,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 23:21:47,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 23:21:47,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 23:21:47,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:47" (1/1) ... [2021-01-06 23:21:47,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:47" (1/1) ... [2021-01-06 23:21:47,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:47" (1/1) ... [2021-01-06 23:21:47,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:47" (1/1) ... [2021-01-06 23:21:47,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:47" (1/1) ... [2021-01-06 23:21:47,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:47" (1/1) ... [2021-01-06 23:21:47,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:47" (1/1) ... [2021-01-06 23:21:47,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 23:21:47,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 23:21:47,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 23:21:47,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 23:21:47,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:47" (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:21:47,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 23:21:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-01-06 23:21:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 23:21:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 23:21:47,804 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-01-06 23:21:47,804 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-01-06 23:21:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-01-06 23:21:47,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-01-06 23:21:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-01-06 23:21:47,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-01-06 23:21:47,805 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-01-06 23:21:47,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-01-06 23:21:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 23:21:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-01-06 23:21:47,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 23:21:47,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 23:21:47,808 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:21:50,022 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 23:21:50,023 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-06 23:21:50,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:21:50 BoogieIcfgContainer [2021-01-06 23:21:50,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 23:21:50,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 23:21:50,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 23:21:50,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 23:21:50,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:21:46" (1/3) ... [2021-01-06 23:21:50,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d60eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:21:50, skipping insertion in model container [2021-01-06 23:21:50,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:21:47" (2/3) ... [2021-01-06 23:21:50,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49d60eb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:21:50, skipping insertion in model container [2021-01-06 23:21:50,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:21:50" (3/3) ... [2021-01-06 23:21:50,034 INFO L111 eAbstractionObserver]: Analyzing ICFG mix040_power.oepc.i [2021-01-06 23:21:50,041 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 23:21:50,041 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 23:21:50,046 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 23:21:50,047 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 23:21:50,087 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,088 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,089 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,089 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,089 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,090 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,090 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,093 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,094 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,095 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,095 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,096 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,096 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,096 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,097 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,098 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,099 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,100 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,101 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,101 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,101 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,102 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,102 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,103 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,106 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,107 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,107 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,107 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,108 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,111 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,112 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,123 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,130 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,130 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,131 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,131 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,132 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,133 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,134 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,135 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,138 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,139 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,139 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,141 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,143 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,144 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,144 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,145 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:21:50,146 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-01-06 23:21:50,166 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-01-06 23:21:50,189 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 23:21:50,189 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 23:21:50,189 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 23:21:50,190 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 23:21:50,190 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 23:21:50,190 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 23:21:50,190 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 23:21:50,190 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 23:21:50,204 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 23:21:50,206 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 119 transitions, 258 flow [2021-01-06 23:21:50,209 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 119 transitions, 258 flow [2021-01-06 23:21:50,211 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-01-06 23:21:50,265 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-01-06 23:21:50,265 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-01-06 23:21:50,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-01-06 23:21:50,276 INFO L116 LiptonReduction]: Number of co-enabled transitions 2876 [2021-01-06 23:21:50,657 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:50,660 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:50,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:50,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:50,742 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:50,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:50,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:50,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:50,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:50,854 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:50,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:50,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:50,909 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,909 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:50,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:50,916 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:50,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:50,991 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:50,992 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:50,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:50,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,038 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,046 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,046 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,085 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,088 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,091 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,119 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,120 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,123 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:21:51,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:21:51,415 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:21:51,415 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:21:51,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:21:51,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:21:51,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:21:51,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:21:51,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:21:51,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:21:51,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:21:51,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:21:51,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:21:51,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:21:51,493 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:21:51,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:21:51,924 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,930 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,933 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:51,962 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,963 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:51,966 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:51,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,094 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,095 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,230 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,231 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,333 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:21:52,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:21:52,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:21:52,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:21:52,337 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:21:52,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:21:52,339 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:21:52,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:21:52,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:21:52,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:21:52,343 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:21:52,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:21:52,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:21:52,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:21:52,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:21:52,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:21:52,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,437 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,462 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,464 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:52,466 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,466 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:52,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:21:52,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:21:53,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-01-06 23:21:53,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:21:55,607 WARN L197 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-01-06 23:21:55,798 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-01-06 23:21:56,231 WARN L197 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-01-06 23:21:56,419 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-01-06 23:21:56,429 INFO L131 LiptonReduction]: Checked pairs total: 8746 [2021-01-06 23:21:56,430 INFO L133 LiptonReduction]: Total number of compositions: 96 [2021-01-06 23:21:56,436 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2021-01-06 23:21:56,933 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5774 states. [2021-01-06 23:21:56,936 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states. [2021-01-06 23:21:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-01-06 23:21:56,941 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:21:56,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-01-06 23:21:56,942 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:21:56,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:21:56,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1218222, now seen corresponding path program 1 times [2021-01-06 23:21:56,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:21:56,963 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379434348] [2021-01-06 23:21:56,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:21:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:21:57,266 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:21:57,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379434348] [2021-01-06 23:21:57,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:21:57,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:21:57,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479171923] [2021-01-06 23:21:57,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:21:57,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:21:57,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:21:57,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:21:57,292 INFO L87 Difference]: Start difference. First operand 5774 states. Second operand 3 states. [2021-01-06 23:21:57,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:21:57,469 INFO L93 Difference]: Finished difference Result 4812 states and 19300 transitions. [2021-01-06 23:21:57,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:21:57,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-01-06 23:21:57,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:21:57,595 INFO L225 Difference]: With dead ends: 4812 [2021-01-06 23:21:57,597 INFO L226 Difference]: Without dead ends: 4062 [2021-01-06 23:21:57,598 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:21:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2021-01-06 23:21:57,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2021-01-06 23:21:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2021-01-06 23:21:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2021-01-06 23:21:57,878 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2021-01-06 23:21:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:21:57,878 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2021-01-06 23:21:57,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:21:57,879 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2021-01-06 23:21:57,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-06 23:21:57,883 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:21:57,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:21:57,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 23:21:57,884 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:21:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:21:57,885 INFO L82 PathProgramCache]: Analyzing trace with hash -982878423, now seen corresponding path program 1 times [2021-01-06 23:21:57,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:21:57,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334520917] [2021-01-06 23:21:57,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:21:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:21:58,167 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:21:58,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334520917] [2021-01-06 23:21:58,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:21:58,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 23:21:58,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114310007] [2021-01-06 23:21:58,170 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:21:58,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:21:58,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:21:58,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:21:58,174 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand 4 states. [2021-01-06 23:21:58,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:21:58,344 INFO L93 Difference]: Finished difference Result 8536 states and 32606 transitions. [2021-01-06 23:21:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:21:58,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-01-06 23:21:58,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:21:58,413 INFO L225 Difference]: With dead ends: 8536 [2021-01-06 23:21:58,413 INFO L226 Difference]: Without dead ends: 6706 [2021-01-06 23:21:58,414 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:21:58,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6706 states. [2021-01-06 23:21:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6706 to 5518. [2021-01-06 23:21:58,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5518 states. [2021-01-06 23:21:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5518 states to 5518 states and 21420 transitions. [2021-01-06 23:21:58,725 INFO L78 Accepts]: Start accepts. Automaton has 5518 states and 21420 transitions. Word has length 12 [2021-01-06 23:21:58,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:21:58,726 INFO L481 AbstractCegarLoop]: Abstraction has 5518 states and 21420 transitions. [2021-01-06 23:21:58,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:21:58,726 INFO L276 IsEmpty]: Start isEmpty. Operand 5518 states and 21420 transitions. [2021-01-06 23:21:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 23:21:58,734 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:21:58,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:21:58,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 23:21:58,735 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:21:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:21:58,745 INFO L82 PathProgramCache]: Analyzing trace with hash -218891594, now seen corresponding path program 1 times [2021-01-06 23:21:58,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:21:58,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771564990] [2021-01-06 23:21:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:21:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:21:58,951 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:21:58,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771564990] [2021-01-06 23:21:58,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:21:58,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:21:58,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166563322] [2021-01-06 23:21:58,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:21:58,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:21:58,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:21:58,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:21:58,957 INFO L87 Difference]: Start difference. First operand 5518 states and 21420 transitions. Second operand 5 states. [2021-01-06 23:21:59,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:21:59,134 INFO L93 Difference]: Finished difference Result 7006 states and 26124 transitions. [2021-01-06 23:21:59,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:21:59,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2021-01-06 23:21:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:21:59,176 INFO L225 Difference]: With dead ends: 7006 [2021-01-06 23:21:59,177 INFO L226 Difference]: Without dead ends: 5878 [2021-01-06 23:21:59,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:21:59,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2021-01-06 23:21:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 4336. [2021-01-06 23:21:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4336 states. [2021-01-06 23:21:59,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4336 states to 4336 states and 16694 transitions. [2021-01-06 23:21:59,410 INFO L78 Accepts]: Start accepts. Automaton has 4336 states and 16694 transitions. Word has length 13 [2021-01-06 23:21:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:21:59,411 INFO L481 AbstractCegarLoop]: Abstraction has 4336 states and 16694 transitions. [2021-01-06 23:21:59,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:21:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4336 states and 16694 transitions. [2021-01-06 23:21:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-06 23:21:59,415 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:21:59,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:21:59,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 23:21:59,416 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:21:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:21:59,417 INFO L82 PathProgramCache]: Analyzing trace with hash 180357111, now seen corresponding path program 1 times [2021-01-06 23:21:59,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:21:59,417 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730376222] [2021-01-06 23:21:59,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:21:59,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:21:59,522 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:21:59,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730376222] [2021-01-06 23:21:59,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:21:59,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:21:59,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188296160] [2021-01-06 23:21:59,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:21:59,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:21:59,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:21:59,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:21:59,525 INFO L87 Difference]: Start difference. First operand 4336 states and 16694 transitions. Second operand 5 states. [2021-01-06 23:21:59,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:21:59,675 INFO L93 Difference]: Finished difference Result 6580 states and 24381 transitions. [2021-01-06 23:21:59,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:21:59,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-01-06 23:21:59,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:21:59,706 INFO L225 Difference]: With dead ends: 6580 [2021-01-06 23:21:59,706 INFO L226 Difference]: Without dead ends: 5678 [2021-01-06 23:21:59,706 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:21:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5678 states. [2021-01-06 23:21:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5678 to 4256. [2021-01-06 23:21:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4256 states. [2021-01-06 23:21:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4256 states to 4256 states and 16330 transitions. [2021-01-06 23:21:59,949 INFO L78 Accepts]: Start accepts. Automaton has 4256 states and 16330 transitions. Word has length 14 [2021-01-06 23:21:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:21:59,949 INFO L481 AbstractCegarLoop]: Abstraction has 4256 states and 16330 transitions. [2021-01-06 23:21:59,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:21:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 4256 states and 16330 transitions. [2021-01-06 23:21:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 23:21:59,954 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:21:59,954 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:21:59,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 23:21:59,954 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:21:59,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:21:59,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1686401088, now seen corresponding path program 1 times [2021-01-06 23:21:59,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:21:59,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024390827] [2021-01-06 23:21:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:21:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:00,047 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:22:00,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024390827] [2021-01-06 23:22:00,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:00,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:22:00,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411182715] [2021-01-06 23:22:00,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:22:00,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:00,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:22:00,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:22:00,050 INFO L87 Difference]: Start difference. First operand 4256 states and 16330 transitions. Second operand 5 states. [2021-01-06 23:22:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:00,173 INFO L93 Difference]: Finished difference Result 6305 states and 23322 transitions. [2021-01-06 23:22:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:22:00,173 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2021-01-06 23:22:00,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:00,199 INFO L225 Difference]: With dead ends: 6305 [2021-01-06 23:22:00,199 INFO L226 Difference]: Without dead ends: 5512 [2021-01-06 23:22:00,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 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:22:00,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5512 states. [2021-01-06 23:22:00,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5512 to 4120. [2021-01-06 23:22:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4120 states. [2021-01-06 23:22:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4120 states to 4120 states and 15748 transitions. [2021-01-06 23:22:00,364 INFO L78 Accepts]: Start accepts. Automaton has 4120 states and 15748 transitions. Word has length 15 [2021-01-06 23:22:00,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:00,364 INFO L481 AbstractCegarLoop]: Abstraction has 4120 states and 15748 transitions. [2021-01-06 23:22:00,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:22:00,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4120 states and 15748 transitions. [2021-01-06 23:22:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 23:22:00,370 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:00,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:00,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 23:22:00,370 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:00,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:00,371 INFO L82 PathProgramCache]: Analyzing trace with hash -786479853, now seen corresponding path program 1 times [2021-01-06 23:22:00,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:00,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048773753] [2021-01-06 23:22:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:00,464 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:22:00,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048773753] [2021-01-06 23:22:00,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:00,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 23:22:00,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834576789] [2021-01-06 23:22:00,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:22:00,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:00,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:22:00,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:22:00,466 INFO L87 Difference]: Start difference. First operand 4120 states and 15748 transitions. Second operand 3 states. [2021-01-06 23:22:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:00,496 INFO L93 Difference]: Finished difference Result 2996 states and 10184 transitions. [2021-01-06 23:22:00,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:22:00,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2021-01-06 23:22:00,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:00,509 INFO L225 Difference]: With dead ends: 2996 [2021-01-06 23:22:00,510 INFO L226 Difference]: Without dead ends: 2996 [2021-01-06 23:22:00,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:22:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2021-01-06 23:22:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2996. [2021-01-06 23:22:00,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2996 states. [2021-01-06 23:22:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 10184 transitions. [2021-01-06 23:22:00,607 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 10184 transitions. Word has length 16 [2021-01-06 23:22:00,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:00,607 INFO L481 AbstractCegarLoop]: Abstraction has 2996 states and 10184 transitions. [2021-01-06 23:22:00,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:22:00,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 10184 transitions. [2021-01-06 23:22:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:22:00,616 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:00,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:00,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 23:22:00,616 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:00,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:00,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1659732252, now seen corresponding path program 1 times [2021-01-06 23:22:00,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:00,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439199034] [2021-01-06 23:22:00,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:00,778 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:22:00,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439199034] [2021-01-06 23:22:00,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:00,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:22:00,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457284789] [2021-01-06 23:22:00,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:22:00,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:00,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:22:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:22:00,781 INFO L87 Difference]: Start difference. First operand 2996 states and 10184 transitions. Second operand 5 states. [2021-01-06 23:22:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:00,885 INFO L93 Difference]: Finished difference Result 5393 states and 17749 transitions. [2021-01-06 23:22:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:22:00,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2021-01-06 23:22:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:00,901 INFO L225 Difference]: With dead ends: 5393 [2021-01-06 23:22:00,901 INFO L226 Difference]: Without dead ends: 3778 [2021-01-06 23:22:00,902 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:22:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2021-01-06 23:22:00,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 2706. [2021-01-06 23:22:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2021-01-06 23:22:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 8929 transitions. [2021-01-06 23:22:00,996 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 8929 transitions. Word has length 18 [2021-01-06 23:22:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:00,996 INFO L481 AbstractCegarLoop]: Abstraction has 2706 states and 8929 transitions. [2021-01-06 23:22:00,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:22:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 8929 transitions. [2021-01-06 23:22:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 23:22:01,002 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:01,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:01,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 23:22:01,002 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1002329949, now seen corresponding path program 1 times [2021-01-06 23:22:01,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:01,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990070993] [2021-01-06 23:22:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:01,133 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:22:01,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990070993] [2021-01-06 23:22:01,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:01,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:22:01,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579761046] [2021-01-06 23:22:01,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:22:01,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:01,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:22:01,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:22:01,136 INFO L87 Difference]: Start difference. First operand 2706 states and 8929 transitions. Second operand 5 states. [2021-01-06 23:22:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:01,230 INFO L93 Difference]: Finished difference Result 4611 states and 14699 transitions. [2021-01-06 23:22:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:22:01,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2021-01-06 23:22:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:01,243 INFO L225 Difference]: With dead ends: 4611 [2021-01-06 23:22:01,243 INFO L226 Difference]: Without dead ends: 3072 [2021-01-06 23:22:01,243 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:22:01,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2021-01-06 23:22:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2346. [2021-01-06 23:22:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2346 states. [2021-01-06 23:22:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 7519 transitions. [2021-01-06 23:22:01,313 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 7519 transitions. Word has length 19 [2021-01-06 23:22:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:01,313 INFO L481 AbstractCegarLoop]: Abstraction has 2346 states and 7519 transitions. [2021-01-06 23:22:01,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:22:01,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 7519 transitions. [2021-01-06 23:22:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 23:22:01,318 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:01,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:01,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 23:22:01,319 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:01,319 INFO L82 PathProgramCache]: Analyzing trace with hash -667300912, now seen corresponding path program 1 times [2021-01-06 23:22:01,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:01,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711510313] [2021-01-06 23:22:01,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:01,451 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:22:01,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711510313] [2021-01-06 23:22:01,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:01,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:22:01,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541808026] [2021-01-06 23:22:01,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:22:01,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:01,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:22:01,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:22:01,453 INFO L87 Difference]: Start difference. First operand 2346 states and 7519 transitions. Second operand 4 states. [2021-01-06 23:22:01,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:01,478 INFO L93 Difference]: Finished difference Result 1468 states and 4195 transitions. [2021-01-06 23:22:01,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 23:22:01,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2021-01-06 23:22:01,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:01,484 INFO L225 Difference]: With dead ends: 1468 [2021-01-06 23:22:01,484 INFO L226 Difference]: Without dead ends: 1468 [2021-01-06 23:22:01,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:22:01,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2021-01-06 23:22:01,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1468. [2021-01-06 23:22:01,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1468 states. [2021-01-06 23:22:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 4195 transitions. [2021-01-06 23:22:01,518 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 4195 transitions. Word has length 19 [2021-01-06 23:22:01,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:01,519 INFO L481 AbstractCegarLoop]: Abstraction has 1468 states and 4195 transitions. [2021-01-06 23:22:01,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:22:01,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 4195 transitions. [2021-01-06 23:22:01,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:22:01,523 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:01,523 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, 1, 1] [2021-01-06 23:22:01,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 23:22:01,523 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:01,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:01,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1790525538, now seen corresponding path program 1 times [2021-01-06 23:22:01,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:01,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114331723] [2021-01-06 23:22:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:01,618 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:22:01,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114331723] [2021-01-06 23:22:01,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:01,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:22:01,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088818943] [2021-01-06 23:22:01,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:22:01,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:01,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:22:01,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:22:01,621 INFO L87 Difference]: Start difference. First operand 1468 states and 4195 transitions. Second operand 5 states. [2021-01-06 23:22:01,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:01,725 INFO L93 Difference]: Finished difference Result 2382 states and 6630 transitions. [2021-01-06 23:22:01,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:22:01,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-01-06 23:22:01,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:01,733 INFO L225 Difference]: With dead ends: 2382 [2021-01-06 23:22:01,733 INFO L226 Difference]: Without dead ends: 1988 [2021-01-06 23:22:01,734 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:22:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2021-01-06 23:22:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1536. [2021-01-06 23:22:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2021-01-06 23:22:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 4301 transitions. [2021-01-06 23:22:01,773 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 4301 transitions. Word has length 22 [2021-01-06 23:22:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:01,774 INFO L481 AbstractCegarLoop]: Abstraction has 1536 states and 4301 transitions. [2021-01-06 23:22:01,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:22:01,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 4301 transitions. [2021-01-06 23:22:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:22:01,778 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:01,778 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, 1, 1] [2021-01-06 23:22:01,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 23:22:01,779 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:01,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1984672270, now seen corresponding path program 2 times [2021-01-06 23:22:01,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:01,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471989710] [2021-01-06 23:22:01,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:01,888 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:22:01,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471989710] [2021-01-06 23:22:01,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:01,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:22:01,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268912107] [2021-01-06 23:22:01,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:22:01,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:01,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:22:01,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:22:01,891 INFO L87 Difference]: Start difference. First operand 1536 states and 4301 transitions. Second operand 5 states. [2021-01-06 23:22:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:01,929 INFO L93 Difference]: Finished difference Result 2217 states and 6085 transitions. [2021-01-06 23:22:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:22:01,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-01-06 23:22:01,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:01,934 INFO L225 Difference]: With dead ends: 2217 [2021-01-06 23:22:01,935 INFO L226 Difference]: Without dead ends: 1524 [2021-01-06 23:22:01,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:22:01,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2021-01-06 23:22:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1458. [2021-01-06 23:22:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2021-01-06 23:22:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 4009 transitions. [2021-01-06 23:22:01,967 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 4009 transitions. Word has length 22 [2021-01-06 23:22:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:01,967 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 4009 transitions. [2021-01-06 23:22:01,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:22:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 4009 transitions. [2021-01-06 23:22:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:22:01,972 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:01,972 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, 1, 1] [2021-01-06 23:22:01,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 23:22:01,972 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:01,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:01,973 INFO L82 PathProgramCache]: Analyzing trace with hash 684520790, now seen corresponding path program 3 times [2021-01-06 23:22:01,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:01,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778401401] [2021-01-06 23:22:01,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:02,127 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:22:02,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778401401] [2021-01-06 23:22:02,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:02,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:22:02,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652201447] [2021-01-06 23:22:02,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:22:02,129 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:22:02,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:22:02,130 INFO L87 Difference]: Start difference. First operand 1458 states and 4009 transitions. Second operand 5 states. [2021-01-06 23:22:02,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:02,164 INFO L93 Difference]: Finished difference Result 1116 states and 3055 transitions. [2021-01-06 23:22:02,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:22:02,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2021-01-06 23:22:02,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:02,168 INFO L225 Difference]: With dead ends: 1116 [2021-01-06 23:22:02,168 INFO L226 Difference]: Without dead ends: 952 [2021-01-06 23:22:02,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:22:02,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2021-01-06 23:22:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2021-01-06 23:22:02,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2021-01-06 23:22:02,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2564 transitions. [2021-01-06 23:22:02,189 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2564 transitions. Word has length 22 [2021-01-06 23:22:02,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:02,189 INFO L481 AbstractCegarLoop]: Abstraction has 952 states and 2564 transitions. [2021-01-06 23:22:02,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:22:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2564 transitions. [2021-01-06 23:22:02,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-06 23:22:02,194 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:02,194 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, 1, 1, 1, 1, 1] [2021-01-06 23:22:02,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 23:22:02,194 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:02,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:02,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1750461190, now seen corresponding path program 1 times [2021-01-06 23:22:02,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:02,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324340309] [2021-01-06 23:22:02,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:02,333 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:22:02,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324340309] [2021-01-06 23:22:02,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:02,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 23:22:02,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378666394] [2021-01-06 23:22:02,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:22:02,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:02,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:22:02,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:22:02,340 INFO L87 Difference]: Start difference. First operand 952 states and 2564 transitions. Second operand 6 states. [2021-01-06 23:22:02,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:02,373 INFO L93 Difference]: Finished difference Result 892 states and 2450 transitions. [2021-01-06 23:22:02,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:22:02,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2021-01-06 23:22:02,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:02,376 INFO L225 Difference]: With dead ends: 892 [2021-01-06 23:22:02,376 INFO L226 Difference]: Without dead ends: 344 [2021-01-06 23:22:02,376 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:22:02,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-01-06 23:22:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2021-01-06 23:22:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2021-01-06 23:22:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 941 transitions. [2021-01-06 23:22:02,383 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 941 transitions. Word has length 25 [2021-01-06 23:22:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:02,383 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 941 transitions. [2021-01-06 23:22:02,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:22:02,384 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 941 transitions. [2021-01-06 23:22:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 23:22:02,385 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:02,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:02,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 23:22:02,385 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1534069925, now seen corresponding path program 1 times [2021-01-06 23:22:02,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:02,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213081146] [2021-01-06 23:22:02,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:22:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:22:02,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213081146] [2021-01-06 23:22:02,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:22:02,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 23:22:02,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617579430] [2021-01-06 23:22:02,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-06 23:22:02,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:22:02,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-06 23:22:02,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:22:02,594 INFO L87 Difference]: Start difference. First operand 344 states and 941 transitions. Second operand 8 states. [2021-01-06 23:22:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:22:02,772 INFO L93 Difference]: Finished difference Result 513 states and 1379 transitions. [2021-01-06 23:22:02,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:22:02,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2021-01-06 23:22:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:22:02,774 INFO L225 Difference]: With dead ends: 513 [2021-01-06 23:22:02,774 INFO L226 Difference]: Without dead ends: 294 [2021-01-06 23:22:02,775 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-01-06 23:22:02,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2021-01-06 23:22:02,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-01-06 23:22:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2021-01-06 23:22:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 781 transitions. [2021-01-06 23:22:02,785 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 781 transitions. Word has length 29 [2021-01-06 23:22:02,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:22:02,786 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 781 transitions. [2021-01-06 23:22:02,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-06 23:22:02,786 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 781 transitions. [2021-01-06 23:22:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-06 23:22:02,788 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:22:02,789 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:22:02,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 23:22:02,789 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:22:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:22:02,790 INFO L82 PathProgramCache]: Analyzing trace with hash -563579995, now seen corresponding path program 2 times [2021-01-06 23:22:02,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:22:02,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107010051] [2021-01-06 23:22:02,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:22:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:22:02,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:22:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:22:02,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:22:03,030 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 23:22:03,030 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 23:22:03,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 23:22:03,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:22:03 BasicIcfg [2021-01-06 23:22:03,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 23:22:03,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 23:22:03,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 23:22:03,195 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 23:22:03,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:21:50" (3/4) ... [2021-01-06 23:22:03,199 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 23:22:03,374 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix040_power.oepc.i-witness.graphml [2021-01-06 23:22:03,374 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 23:22:03,375 INFO L168 Benchmark]: Toolchain (without parser) took 16557.05 ms. Allocated memory was 165.7 MB in the beginning and 744.5 MB in the end (delta: 578.8 MB). Free memory was 138.9 MB in the beginning and 631.3 MB in the end (delta: -492.3 MB). Peak memory consumption was 87.5 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:03,376 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 165.7 MB. Free memory is still 137.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 23:22:03,376 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.92 ms. Allocated memory is still 165.7 MB. Free memory was 138.6 MB in the beginning and 138.7 MB in the end (delta: -69.9 kB). Peak memory consumption was 33.2 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:03,376 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.47 ms. Allocated memory is still 165.7 MB. Free memory was 138.7 MB in the beginning and 136.1 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:22:03,377 INFO L168 Benchmark]: Boogie Preprocessor took 63.40 ms. Allocated memory is still 165.7 MB. Free memory was 136.1 MB in the beginning and 134.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:03,377 INFO L168 Benchmark]: RCFGBuilder took 2329.73 ms. Allocated memory was 165.7 MB in the beginning and 199.2 MB in the end (delta: 33.6 MB). Free memory was 134.0 MB in the beginning and 117.1 MB in the end (delta: 16.9 MB). Peak memory consumption was 102.8 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:03,377 INFO L168 Benchmark]: TraceAbstraction took 13167.38 ms. Allocated memory was 199.2 MB in the beginning and 744.5 MB in the end (delta: 545.3 MB). Free memory was 116.7 MB in the beginning and 657.4 MB in the end (delta: -540.8 MB). Peak memory consumption was 253.0 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:03,378 INFO L168 Benchmark]: Witness Printer took 179.53 ms. Allocated memory is still 744.5 MB. Free memory was 657.4 MB in the beginning and 631.3 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. [2021-01-06 23:22:03,380 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.17 ms. Allocated memory is still 165.7 MB. Free memory is still 137.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 732.92 ms. Allocated memory is still 165.7 MB. Free memory was 138.6 MB in the beginning and 138.7 MB in the end (delta: -69.9 kB). Peak memory consumption was 33.2 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 65.47 ms. Allocated memory is still 165.7 MB. Free memory was 138.7 MB in the beginning and 136.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 63.40 ms. Allocated memory is still 165.7 MB. Free memory was 136.1 MB in the beginning and 134.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2329.73 ms. Allocated memory was 165.7 MB in the beginning and 199.2 MB in the end (delta: 33.6 MB). Free memory was 134.0 MB in the beginning and 117.1 MB in the end (delta: 16.9 MB). Peak memory consumption was 102.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13167.38 ms. Allocated memory was 199.2 MB in the beginning and 744.5 MB in the end (delta: 545.3 MB). Free memory was 116.7 MB in the beginning and 657.4 MB in the end (delta: -540.8 MB). Peak memory consumption was 253.0 MB. Max. memory is 8.0 GB. * Witness Printer took 179.53 ms. Allocated memory is still 744.5 MB. Free memory was 657.4 MB in the beginning and 631.3 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2016 VarBasedMoverChecksPositive, 79 VarBasedMoverChecksNegative, 33 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 342 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.2s, 130 PlacesBefore, 48 PlacesAfterwards, 119 TransitionsBefore, 36 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 8746 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1057; [L870] FCALL, FORK 0 pthread_create(&t1057, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1058; [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t1058, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t1059; [L874] FCALL, FORK 0 pthread_create(&t1059, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t1060; [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L788] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L876] FCALL, FORK 0 pthread_create(&t1060, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L822] 4 z = 1 [L825] 4 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L847] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L808] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L808] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L808] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L882] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L882] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L882] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 637 SDtfs, 750 SDslu, 1224 SDs, 0 SdLazy, 336 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5774occurred 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: 1.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 7860 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 28077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...