/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/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 23:24:49,350 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 23:24:49,353 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 23:24:49,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 23:24:49,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 23:24:49,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 23:24:49,400 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 23:24:49,402 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 23:24:49,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 23:24:49,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 23:24:49,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 23:24:49,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 23:24:49,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 23:24:49,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 23:24:49,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 23:24:49,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 23:24:49,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 23:24:49,416 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 23:24:49,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 23:24:49,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 23:24:49,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 23:24:49,441 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 23:24:49,443 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 23:24:49,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 23:24:49,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 23:24:49,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 23:24:49,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 23:24:49,458 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 23:24:49,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 23:24:49,462 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 23:24:49,463 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 23:24:49,464 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 23:24:49,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 23:24:49,467 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 23:24:49,468 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 23:24:49,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 23:24:49,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 23:24:49,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 23:24:49,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 23:24:49,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 23:24:49,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 23:24:49,481 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:24:49,529 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 23:24:49,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 23:24:49,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 23:24:49,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 23:24:49,535 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 23:24:49,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 23:24:49,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 23:24:49,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 23:24:49,536 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 23:24:49,536 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 23:24:49,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 23:24:49,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 23:24:49,538 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 23:24:49,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 23:24:49,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 23:24:49,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 23:24:49,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 23:24:49,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:24:49,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 23:24:49,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 23:24:49,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 23:24:49,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 23:24:49,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 23:24:49,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 23:24:49,541 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 23:24:49,541 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:24:49,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 23:24:50,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 23:24:50,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 23:24:50,031 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 23:24:50,032 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 23:24:50,033 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2021-01-06 23:24:50,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3e48920de/2848a2df595c4a31a6e677be96cdebe1/FLAGe8b586c69 [2021-01-06 23:24:50,928 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 23:24:50,929 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix051_tso.oepc.i [2021-01-06 23:24:50,951 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3e48920de/2848a2df595c4a31a6e677be96cdebe1/FLAGe8b586c69 [2021-01-06 23:24:51,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3e48920de/2848a2df595c4a31a6e677be96cdebe1 [2021-01-06 23:24:51,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 23:24:51,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 23:24:51,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 23:24:51,134 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 23:24:51,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 23:24:51,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:24:51" (1/1) ... [2021-01-06 23:24:51,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cacdb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:51, skipping insertion in model container [2021-01-06 23:24:51,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:24:51" (1/1) ... [2021-01-06 23:24:51,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 23:24:51,221 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 23:24:51,413 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/mix051_tso.oepc.i[949,962] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$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[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL] [2021-01-06 23:24:51,714 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:24:51,725 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 23:24:51,740 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/mix051_tso.oepc.i[949,962] left hand side expression in assignment: lhs: VariableLHS[~a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p1_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p3_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$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[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x$flush_delayed~0,GLOBAL] [2021-01-06 23:24:51,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:24:52,031 INFO L208 MainTranslator]: Completed translation [2021-01-06 23:24:52,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:52 WrapperNode [2021-01-06 23:24:52,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 23:24:52,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 23:24:52,033 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 23:24:52,033 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 23:24:52,043 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:24:52" (1/1) ... [2021-01-06 23:24:52,065 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:24:52" (1/1) ... [2021-01-06 23:24:52,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 23:24:52,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 23:24:52,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 23:24:52,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 23:24:52,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:52" (1/1) ... [2021-01-06 23:24:52,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:52" (1/1) ... [2021-01-06 23:24:52,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:52" (1/1) ... [2021-01-06 23:24:52,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:52" (1/1) ... [2021-01-06 23:24:52,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:52" (1/1) ... [2021-01-06 23:24:52,180 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:52" (1/1) ... [2021-01-06 23:24:52,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:52" (1/1) ... [2021-01-06 23:24:52,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 23:24:52,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 23:24:52,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 23:24:52,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 23:24:52,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:52" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:24:52,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 23:24:52,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-01-06 23:24:52,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 23:24:52,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 23:24:52,297 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-01-06 23:24:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-01-06 23:24:52,297 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-01-06 23:24:52,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-01-06 23:24:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-01-06 23:24:52,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-01-06 23:24:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-01-06 23:24:52,298 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-01-06 23:24:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 23:24:52,298 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-01-06 23:24:52,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 23:24:52,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 23:24:52,301 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:24:55,168 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 23:24:55,168 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-06 23:24:55,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:24:55 BoogieIcfgContainer [2021-01-06 23:24:55,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 23:24:55,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 23:24:55,176 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 23:24:55,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 23:24:55,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:24:51" (1/3) ... [2021-01-06 23:24:55,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a415851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:24:55, skipping insertion in model container [2021-01-06 23:24:55,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:24:52" (2/3) ... [2021-01-06 23:24:55,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a415851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:24:55, skipping insertion in model container [2021-01-06 23:24:55,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:24:55" (3/3) ... [2021-01-06 23:24:55,185 INFO L111 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2021-01-06 23:24:55,194 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 23:24:55,194 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 23:24:55,200 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 23:24:55,201 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 23:24:55,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,259 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,259 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,260 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,260 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,260 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,260 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,260 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,262 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,263 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,264 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,268 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,268 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,268 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,269 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,269 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,269 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,269 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,270 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,271 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,271 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,271 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,272 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,278 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,283 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,283 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,284 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,284 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,284 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,289 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,289 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,289 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,290 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,290 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,291 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,294 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,295 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,302 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,303 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,303 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,303 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,309 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,309 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,310 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,310 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:24:55,312 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-01-06 23:24:55,331 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-01-06 23:24:55,356 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 23:24:55,356 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 23:24:55,356 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 23:24:55,356 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 23:24:55,357 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 23:24:55,357 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 23:24:55,357 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 23:24:55,357 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 23:24:55,372 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 23:24:55,375 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 116 transitions, 252 flow [2021-01-06 23:24:55,378 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 116 transitions, 252 flow [2021-01-06 23:24:55,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 116 transitions, 252 flow [2021-01-06 23:24:55,498 INFO L129 PetriNetUnfolder]: 2/112 cut-off events. [2021-01-06 23:24:55,500 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-01-06 23:24:55,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 112 events. 2/112 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-01-06 23:24:55,514 INFO L116 LiptonReduction]: Number of co-enabled transitions 2664 [2021-01-06 23:24:55,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:55,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:55,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:55,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:55,901 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:55,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:55,907 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:24:55,907 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:55,947 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:55,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:55,952 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:55,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:55,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:55,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:55,971 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:24:55,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:56,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-01-06 23:24:56,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:56,161 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:56,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:56,163 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:56,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:56,167 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:56,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:56,171 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:24:56,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:56,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:56,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:56,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:56,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:56,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:24:56,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:56,232 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:24:56,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:24:56,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-01-06 23:24:56,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:56,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-01-06 23:24:56,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:24:56,454 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:24:56,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:56,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:24:56,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:24:57,706 WARN L197 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-01-06 23:24:58,270 WARN L197 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-01-06 23:25:00,686 WARN L197 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-01-06 23:25:01,760 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 265 [2021-01-06 23:25:01,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:01,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:01,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:01,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:01,981 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:01,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:01,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:01,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:02,043 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,051 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:25:02,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,083 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:25:02,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,361 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,362 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,362 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,365 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,368 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:25:02,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,394 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,400 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:25:02,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,478 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,483 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:25:02,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,509 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,511 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:25:02,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,584 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:25:02,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,613 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:25:02,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,845 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,849 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,852 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:25:02,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,895 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,896 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,897 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:02,899 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:02,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:02,902 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:25:02,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:03,119 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2021-01-06 23:25:03,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:03,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:03,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:03,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:03,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:03,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:03,389 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:25:03,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:03,416 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:03,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:03,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:03,417 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:03,419 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:03,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:03,422 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:25:03,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:03,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:03,601 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:03,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:03,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:03,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:03,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:03,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:03,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:03,698 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:03,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:03,699 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:03,699 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:03,725 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2021-01-06 23:25:03,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:03,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2021-01-06 23:25:03,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:04,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-01-06 23:25:04,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:04,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:04,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:04,075 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:04,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:04,107 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:04,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:04,109 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:04,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:04,829 WARN L197 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-01-06 23:25:04,936 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-06 23:25:05,538 WARN L197 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-01-06 23:25:05,830 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-01-06 23:25:05,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:05,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:05,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:05,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:05,899 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:05,900 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:05,901 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:05,902 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:06,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:06,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,141 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:06,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,142 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:06,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,221 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:06,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,223 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:06,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,249 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:06,250 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,251 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:06,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,292 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:06,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,293 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:06,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2021-01-06 23:25:06,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,329 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2021-01-06 23:25:06,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,374 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,375 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,378 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:06,380 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:25:06,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:06,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,512 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,514 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,536 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,539 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:06,541 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:25:06,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:06,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,569 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,571 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:06,573 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:25:06,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:06,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:06,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:06,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:06,784 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2021-01-06 23:25:07,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,182 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,184 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,185 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:07,187 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:25:07,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:07,205 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,208 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:07,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,210 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:07,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,295 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:07,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:07,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:07,321 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:25:07,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:07,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,353 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:07,358 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:25:07,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:07,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,378 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,379 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:07,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:07,434 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,435 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,437 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:07,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:07,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,462 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:07,464 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:25:07,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:07,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,595 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:07,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:25:07,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:25:07,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:25:07,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:07,622 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:25:07,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:25:09,175 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-01-06 23:25:09,338 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-01-06 23:25:09,505 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-01-06 23:25:09,690 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-01-06 23:25:10,261 WARN L197 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-01-06 23:25:10,525 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-01-06 23:25:11,089 WARN L197 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-01-06 23:25:11,372 WARN L197 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-01-06 23:25:11,381 INFO L131 LiptonReduction]: Checked pairs total: 7982 [2021-01-06 23:25:11,381 INFO L133 LiptonReduction]: Total number of compositions: 94 [2021-01-06 23:25:11,388 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2021-01-06 23:25:11,838 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4872 states. [2021-01-06 23:25:11,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4872 states. [2021-01-06 23:25:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-06 23:25:11,848 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:11,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-06 23:25:11,849 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:11,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1161296880, now seen corresponding path program 1 times [2021-01-06 23:25:11,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:11,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029099859] [2021-01-06 23:25:11,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:12,252 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:25:12,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029099859] [2021-01-06 23:25:12,254 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:12,254 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:25:12,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945762753] [2021-01-06 23:25:12,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:25:12,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:12,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:25:12,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:25:12,284 INFO L87 Difference]: Start difference. First operand 4872 states. Second operand 3 states. [2021-01-06 23:25:12,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:12,489 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2021-01-06 23:25:12,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:25:12,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-06 23:25:12,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:12,557 INFO L225 Difference]: With dead ends: 4062 [2021-01-06 23:25:12,557 INFO L226 Difference]: Without dead ends: 3437 [2021-01-06 23:25:12,559 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:25:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2021-01-06 23:25:12,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3437. [2021-01-06 23:25:12,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3437 states. [2021-01-06 23:25:12,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 13500 transitions. [2021-01-06 23:25:12,844 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 13500 transitions. Word has length 5 [2021-01-06 23:25:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:12,844 INFO L481 AbstractCegarLoop]: Abstraction has 3437 states and 13500 transitions. [2021-01-06 23:25:12,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:25:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 13500 transitions. [2021-01-06 23:25:12,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-01-06 23:25:12,858 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:12,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:25:12,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 23:25:12,858 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:12,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:12,859 INFO L82 PathProgramCache]: Analyzing trace with hash -955804137, now seen corresponding path program 1 times [2021-01-06 23:25:12,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:12,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904816609] [2021-01-06 23:25:12,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:13,131 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:25:13,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904816609] [2021-01-06 23:25:13,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:13,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:25:13,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114038923] [2021-01-06 23:25:13,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:25:13,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:13,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:25:13,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:25:13,135 INFO L87 Difference]: Start difference. First operand 3437 states and 13500 transitions. Second operand 5 states. [2021-01-06 23:25:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:13,430 INFO L93 Difference]: Finished difference Result 3954 states and 15014 transitions. [2021-01-06 23:25:13,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:25:13,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2021-01-06 23:25:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:13,465 INFO L225 Difference]: With dead ends: 3954 [2021-01-06 23:25:13,465 INFO L226 Difference]: Without dead ends: 3329 [2021-01-06 23:25:13,466 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:25:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2021-01-06 23:25:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3329. [2021-01-06 23:25:13,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3329 states. [2021-01-06 23:25:13,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3329 states to 3329 states and 12960 transitions. [2021-01-06 23:25:13,638 INFO L78 Accepts]: Start accepts. Automaton has 3329 states and 12960 transitions. Word has length 12 [2021-01-06 23:25:13,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:13,639 INFO L481 AbstractCegarLoop]: Abstraction has 3329 states and 12960 transitions. [2021-01-06 23:25:13,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:25:13,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3329 states and 12960 transitions. [2021-01-06 23:25:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-01-06 23:25:13,644 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:13,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:25:13,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 23:25:13,644 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1579389364, now seen corresponding path program 1 times [2021-01-06 23:25:13,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:13,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880322033] [2021-01-06 23:25:13,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:14,001 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:25:14,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880322033] [2021-01-06 23:25:14,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:14,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:25:14,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561204637] [2021-01-06 23:25:14,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:25:14,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:14,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:25:14,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:25:14,004 INFO L87 Difference]: Start difference. First operand 3329 states and 12960 transitions. Second operand 6 states. [2021-01-06 23:25:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:14,291 INFO L93 Difference]: Finished difference Result 4496 states and 17143 transitions. [2021-01-06 23:25:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:25:14,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2021-01-06 23:25:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:14,335 INFO L225 Difference]: With dead ends: 4496 [2021-01-06 23:25:14,335 INFO L226 Difference]: Without dead ends: 3989 [2021-01-06 23:25:14,336 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:25:14,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3989 states. [2021-01-06 23:25:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3989 to 3797. [2021-01-06 23:25:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2021-01-06 23:25:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 14670 transitions. [2021-01-06 23:25:14,523 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 14670 transitions. Word has length 14 [2021-01-06 23:25:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:14,523 INFO L481 AbstractCegarLoop]: Abstraction has 3797 states and 14670 transitions. [2021-01-06 23:25:14,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:25:14,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 14670 transitions. [2021-01-06 23:25:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 23:25:14,528 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:14,528 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:25:14,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 23:25:14,626 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:14,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:14,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1378068354, now seen corresponding path program 1 times [2021-01-06 23:25:14,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:14,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075177203] [2021-01-06 23:25:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:14,856 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:25:14,857 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075177203] [2021-01-06 23:25:14,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:14,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:25:14,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679687389] [2021-01-06 23:25:14,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:25:14,858 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:14,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:25:14,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:25:14,859 INFO L87 Difference]: Start difference. First operand 3797 states and 14670 transitions. Second operand 6 states. [2021-01-06 23:25:15,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:15,045 INFO L93 Difference]: Finished difference Result 4749 states and 18075 transitions. [2021-01-06 23:25:15,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:25:15,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-01-06 23:25:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:15,083 INFO L225 Difference]: With dead ends: 4749 [2021-01-06 23:25:15,083 INFO L226 Difference]: Without dead ends: 4367 [2021-01-06 23:25:15,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:25:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4367 states. [2021-01-06 23:25:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4367 to 3865. [2021-01-06 23:25:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3865 states. [2021-01-06 23:25:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3865 states to 3865 states and 14819 transitions. [2021-01-06 23:25:15,265 INFO L78 Accepts]: Start accepts. Automaton has 3865 states and 14819 transitions. Word has length 15 [2021-01-06 23:25:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:15,266 INFO L481 AbstractCegarLoop]: Abstraction has 3865 states and 14819 transitions. [2021-01-06 23:25:15,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:25:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand 3865 states and 14819 transitions. [2021-01-06 23:25:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 23:25:15,270 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:15,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:25:15,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 23:25:15,271 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash 392659238, now seen corresponding path program 1 times [2021-01-06 23:25:15,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:15,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710726460] [2021-01-06 23:25:15,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:15,407 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:25:15,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710726460] [2021-01-06 23:25:15,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:15,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:25:15,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358772057] [2021-01-06 23:25:15,408 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:25:15,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:15,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:25:15,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:25:15,411 INFO L87 Difference]: Start difference. First operand 3865 states and 14819 transitions. Second operand 4 states. [2021-01-06 23:25:15,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:15,472 INFO L93 Difference]: Finished difference Result 3690 states and 12835 transitions. [2021-01-06 23:25:15,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:25:15,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2021-01-06 23:25:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:15,486 INFO L225 Difference]: With dead ends: 3690 [2021-01-06 23:25:15,486 INFO L226 Difference]: Without dead ends: 2883 [2021-01-06 23:25:15,486 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:25:15,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2021-01-06 23:25:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2883. [2021-01-06 23:25:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2021-01-06 23:25:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 9944 transitions. [2021-01-06 23:25:15,591 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 9944 transitions. Word has length 15 [2021-01-06 23:25:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:15,592 INFO L481 AbstractCegarLoop]: Abstraction has 2883 states and 9944 transitions. [2021-01-06 23:25:15,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:25:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 9944 transitions. [2021-01-06 23:25:15,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-06 23:25:15,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:15,596 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:25:15,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 23:25:15,596 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash -795829555, now seen corresponding path program 1 times [2021-01-06 23:25:15,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:15,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288666371] [2021-01-06 23:25:15,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:15,733 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:25:15,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288666371] [2021-01-06 23:25:15,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:15,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:25:15,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642949060] [2021-01-06 23:25:15,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:25:15,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:15,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:25:15,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:25:15,736 INFO L87 Difference]: Start difference. First operand 2883 states and 9944 transitions. Second operand 5 states. [2021-01-06 23:25:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:15,811 INFO L93 Difference]: Finished difference Result 2188 states and 6893 transitions. [2021-01-06 23:25:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:25:15,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2021-01-06 23:25:15,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:15,818 INFO L225 Difference]: With dead ends: 2188 [2021-01-06 23:25:15,819 INFO L226 Difference]: Without dead ends: 1699 [2021-01-06 23:25:15,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:25:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1699 states. [2021-01-06 23:25:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1699 to 1565. [2021-01-06 23:25:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1565 states. [2021-01-06 23:25:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 4791 transitions. [2021-01-06 23:25:15,904 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 4791 transitions. Word has length 16 [2021-01-06 23:25:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:15,905 INFO L481 AbstractCegarLoop]: Abstraction has 1565 states and 4791 transitions. [2021-01-06 23:25:15,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:25:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 4791 transitions. [2021-01-06 23:25:15,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-06 23:25:15,909 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:15,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:25:15,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 23:25:15,910 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:15,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:15,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1229047456, now seen corresponding path program 1 times [2021-01-06 23:25:15,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:15,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300902383] [2021-01-06 23:25:15,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:16,026 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:25:16,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300902383] [2021-01-06 23:25:16,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:16,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 23:25:16,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529754254] [2021-01-06 23:25:16,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:25:16,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:16,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:25:16,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:25:16,028 INFO L87 Difference]: Start difference. First operand 1565 states and 4791 transitions. Second operand 6 states. [2021-01-06 23:25:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:16,094 INFO L93 Difference]: Finished difference Result 1282 states and 3906 transitions. [2021-01-06 23:25:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:25:16,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2021-01-06 23:25:16,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:16,099 INFO L225 Difference]: With dead ends: 1282 [2021-01-06 23:25:16,099 INFO L226 Difference]: Without dead ends: 1137 [2021-01-06 23:25:16,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:25:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2021-01-06 23:25:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1033. [2021-01-06 23:25:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2021-01-06 23:25:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 3200 transitions. [2021-01-06 23:25:16,131 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 3200 transitions. Word has length 20 [2021-01-06 23:25:16,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:16,132 INFO L481 AbstractCegarLoop]: Abstraction has 1033 states and 3200 transitions. [2021-01-06 23:25:16,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:25:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 3200 transitions. [2021-01-06 23:25:16,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 23:25:16,136 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:16,136 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] [2021-01-06 23:25:16,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 23:25:16,136 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:16,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:16,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1363755034, now seen corresponding path program 1 times [2021-01-06 23:25:16,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:16,137 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468283714] [2021-01-06 23:25:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:16,250 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:25:16,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468283714] [2021-01-06 23:25:16,251 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:16,251 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:25:16,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273830559] [2021-01-06 23:25:16,251 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:25:16,252 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:16,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:25:16,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:25:16,253 INFO L87 Difference]: Start difference. First operand 1033 states and 3200 transitions. Second operand 5 states. [2021-01-06 23:25:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:16,301 INFO L93 Difference]: Finished difference Result 1410 states and 4263 transitions. [2021-01-06 23:25:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:25:16,302 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2021-01-06 23:25:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:16,306 INFO L225 Difference]: With dead ends: 1410 [2021-01-06 23:25:16,307 INFO L226 Difference]: Without dead ends: 1039 [2021-01-06 23:25:16,307 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:25:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2021-01-06 23:25:16,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1033. [2021-01-06 23:25:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1033 states. [2021-01-06 23:25:16,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 3098 transitions. [2021-01-06 23:25:16,338 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 3098 transitions. Word has length 24 [2021-01-06 23:25:16,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:16,338 INFO L481 AbstractCegarLoop]: Abstraction has 1033 states and 3098 transitions. [2021-01-06 23:25:16,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:25:16,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 3098 transitions. [2021-01-06 23:25:16,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-06 23:25:16,342 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:16,343 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] [2021-01-06 23:25:16,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 23:25:16,343 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:16,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash 333383704, now seen corresponding path program 1 times [2021-01-06 23:25:16,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:16,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223453918] [2021-01-06 23:25:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:16,558 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:25:16,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223453918] [2021-01-06 23:25:16,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:16,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 23:25:16,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10560193] [2021-01-06 23:25:16,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 23:25:16,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 23:25:16,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:25:16,561 INFO L87 Difference]: Start difference. First operand 1033 states and 3098 transitions. Second operand 7 states. [2021-01-06 23:25:16,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:16,656 INFO L93 Difference]: Finished difference Result 985 states and 3001 transitions. [2021-01-06 23:25:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:25:16,656 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2021-01-06 23:25:16,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:16,660 INFO L225 Difference]: With dead ends: 985 [2021-01-06 23:25:16,660 INFO L226 Difference]: Without dead ends: 517 [2021-01-06 23:25:16,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2021-01-06 23:25:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-01-06 23:25:16,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 493. [2021-01-06 23:25:16,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2021-01-06 23:25:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1436 transitions. [2021-01-06 23:25:16,677 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1436 transitions. Word has length 24 [2021-01-06 23:25:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:16,678 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 1436 transitions. [2021-01-06 23:25:16,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 23:25:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1436 transitions. [2021-01-06 23:25:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 23:25:16,680 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:16,680 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] [2021-01-06 23:25:16,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 23:25:16,681 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:16,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:16,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1465377134, now seen corresponding path program 1 times [2021-01-06 23:25:16,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:16,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589180094] [2021-01-06 23:25:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:16,906 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:25:16,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589180094] [2021-01-06 23:25:16,907 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:16,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 23:25:16,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541552092] [2021-01-06 23:25:16,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 23:25:16,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:16,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 23:25:16,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-01-06 23:25:16,909 INFO L87 Difference]: Start difference. First operand 493 states and 1436 transitions. Second operand 9 states. [2021-01-06 23:25:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:17,377 INFO L93 Difference]: Finished difference Result 1062 states and 3046 transitions. [2021-01-06 23:25:17,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 23:25:17,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2021-01-06 23:25:17,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:17,380 INFO L225 Difference]: With dead ends: 1062 [2021-01-06 23:25:17,380 INFO L226 Difference]: Without dead ends: 460 [2021-01-06 23:25:17,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2021-01-06 23:25:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-01-06 23:25:17,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 333. [2021-01-06 23:25:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2021-01-06 23:25:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 908 transitions. [2021-01-06 23:25:17,391 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 908 transitions. Word has length 28 [2021-01-06 23:25:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:17,392 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 908 transitions. [2021-01-06 23:25:17,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 23:25:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 908 transitions. [2021-01-06 23:25:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 23:25:17,393 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:17,393 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] [2021-01-06 23:25:17,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 23:25:17,394 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:17,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:17,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1414490438, now seen corresponding path program 2 times [2021-01-06 23:25:17,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:17,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049570072] [2021-01-06 23:25:17,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 23:25:17,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049570072] [2021-01-06 23:25:17,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:17,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 23:25:17,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658099544] [2021-01-06 23:25:17,709 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 23:25:17,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:17,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 23:25:17,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-01-06 23:25:17,711 INFO L87 Difference]: Start difference. First operand 333 states and 908 transitions. Second operand 9 states. [2021-01-06 23:25:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:18,002 INFO L93 Difference]: Finished difference Result 502 states and 1374 transitions. [2021-01-06 23:25:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-06 23:25:18,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2021-01-06 23:25:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:18,005 INFO L225 Difference]: With dead ends: 502 [2021-01-06 23:25:18,005 INFO L226 Difference]: Without dead ends: 415 [2021-01-06 23:25:18,006 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-01-06 23:25:18,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2021-01-06 23:25:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 293. [2021-01-06 23:25:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2021-01-06 23:25:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 772 transitions. [2021-01-06 23:25:18,016 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 772 transitions. Word has length 28 [2021-01-06 23:25:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:18,016 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 772 transitions. [2021-01-06 23:25:18,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 23:25:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 772 transitions. [2021-01-06 23:25:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 23:25:18,019 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:18,020 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] [2021-01-06 23:25:18,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 23:25:18,020 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1734748322, now seen corresponding path program 3 times [2021-01-06 23:25:18,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:18,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300929492] [2021-01-06 23:25:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:18,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:25:18,399 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:25:18,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300929492] [2021-01-06 23:25:18,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:25:18,400 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-06 23:25:18,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470403389] [2021-01-06 23:25:18,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 23:25:18,402 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:25:18,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 23:25:18,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-01-06 23:25:18,406 INFO L87 Difference]: Start difference. First operand 293 states and 772 transitions. Second operand 10 states. [2021-01-06 23:25:18,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:25:18,650 INFO L93 Difference]: Finished difference Result 450 states and 1188 transitions. [2021-01-06 23:25:18,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:25:18,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2021-01-06 23:25:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:25:18,652 INFO L225 Difference]: With dead ends: 450 [2021-01-06 23:25:18,652 INFO L226 Difference]: Without dead ends: 357 [2021-01-06 23:25:18,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-01-06 23:25:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-01-06 23:25:18,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 257. [2021-01-06 23:25:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2021-01-06 23:25:18,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 684 transitions. [2021-01-06 23:25:18,662 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 684 transitions. Word has length 28 [2021-01-06 23:25:18,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:25:18,663 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 684 transitions. [2021-01-06 23:25:18,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 23:25:18,663 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 684 transitions. [2021-01-06 23:25:18,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 23:25:18,664 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:25:18,664 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] [2021-01-06 23:25:18,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 23:25:18,665 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:25:18,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:25:18,665 INFO L82 PathProgramCache]: Analyzing trace with hash -89157730, now seen corresponding path program 4 times [2021-01-06 23:25:18,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:25:18,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553566991] [2021-01-06 23:25:18,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:25:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:25:18,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:25:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:25:18,843 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:25:18,912 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 23:25:18,913 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 23:25:18,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 23:25:19,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:25:19 BasicIcfg [2021-01-06 23:25:19,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 23:25:19,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 23:25:19,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 23:25:19,072 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 23:25:19,073 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:24:55" (3/4) ... [2021-01-06 23:25:19,079 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 23:25:19,238 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix051_tso.oepc.i-witness.graphml [2021-01-06 23:25:19,238 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 23:25:19,239 INFO L168 Benchmark]: Toolchain (without parser) took 28108.67 ms. Allocated memory was 156.2 MB in the beginning and 440.4 MB in the end (delta: 284.2 MB). Free memory was 129.5 MB in the beginning and 155.7 MB in the end (delta: -26.2 MB). Peak memory consumption was 258.3 MB. Max. memory is 8.0 GB. [2021-01-06 23:25:19,240 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 156.2 MB. Free memory is still 128.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 23:25:19,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 898.30 ms. Allocated memory is still 156.2 MB. Free memory was 129.3 MB in the beginning and 128.4 MB in the end (delta: 867.1 kB). Peak memory consumption was 30.8 MB. Max. memory is 8.0 GB. [2021-01-06 23:25:19,240 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.47 ms. Allocated memory is still 156.2 MB. Free memory was 128.4 MB in the beginning and 125.8 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:25:19,241 INFO L168 Benchmark]: Boogie Preprocessor took 82.28 ms. Allocated memory is still 156.2 MB. Free memory was 125.8 MB in the beginning and 123.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:25:19,241 INFO L168 Benchmark]: RCFGBuilder took 2976.96 ms. Allocated memory was 156.2 MB in the beginning and 190.8 MB in the end (delta: 34.6 MB). Free memory was 123.2 MB in the beginning and 85.1 MB in the end (delta: 38.1 MB). Peak memory consumption was 90.0 MB. Max. memory is 8.0 GB. [2021-01-06 23:25:19,241 INFO L168 Benchmark]: TraceAbstraction took 23897.38 ms. Allocated memory was 190.8 MB in the beginning and 440.4 MB in the end (delta: 249.6 MB). Free memory was 85.1 MB in the beginning and 177.7 MB in the end (delta: -92.7 MB). Peak memory consumption was 156.4 MB. Max. memory is 8.0 GB. [2021-01-06 23:25:19,242 INFO L168 Benchmark]: Witness Printer took 165.85 ms. Allocated memory is still 440.4 MB. Free memory was 177.2 MB in the beginning and 155.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2021-01-06 23:25:19,244 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 156.2 MB. Free memory is still 128.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 898.30 ms. Allocated memory is still 156.2 MB. Free memory was 129.3 MB in the beginning and 128.4 MB in the end (delta: 867.1 kB). Peak memory consumption was 30.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 78.47 ms. Allocated memory is still 156.2 MB. Free memory was 128.4 MB in the beginning and 125.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 82.28 ms. Allocated memory is still 156.2 MB. Free memory was 125.8 MB in the beginning and 123.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2976.96 ms. Allocated memory was 156.2 MB in the beginning and 190.8 MB in the end (delta: 34.6 MB). Free memory was 123.2 MB in the beginning and 85.1 MB in the end (delta: 38.1 MB). Peak memory consumption was 90.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 23897.38 ms. Allocated memory was 190.8 MB in the beginning and 440.4 MB in the end (delta: 249.6 MB). Free memory was 85.1 MB in the beginning and 177.7 MB in the end (delta: -92.7 MB). Peak memory consumption was 156.4 MB. Max. memory is 8.0 GB. * Witness Printer took 165.85 ms. Allocated memory is still 440.4 MB. Free memory was 177.2 MB in the beginning and 155.7 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1658 VarBasedMoverChecksPositive, 83 VarBasedMoverChecksNegative, 23 SemBasedMoverChecksPositive, 60 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 204 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 16.0s, 127 PlacesBefore, 47 PlacesAfterwards, 116 TransitionsBefore, 35 TransitionsAfterwards, 2664 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 7982 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L848] 0 pthread_t t1377; [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1378; [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1379; [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] 0 pthread_t t1380; [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L823] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L835] 4 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L873] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L874] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L875] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L877] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 23.5s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.4s, HoareTripleCheckerStatistics: 464 SDtfs, 842 SDslu, 1131 SDs, 0 SdLazy, 553 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4872occurred 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.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 1311 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 257 NumberOfCodeBlocks, 257 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 45112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...