/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/mix024_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 23:17:47,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 23:17:47,228 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 23:17:47,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 23:17:47,274 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 23:17:47,276 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 23:17:47,278 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 23:17:47,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 23:17:47,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 23:17:47,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 23:17:47,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 23:17:47,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 23:17:47,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 23:17:47,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 23:17:47,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 23:17:47,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 23:17:47,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 23:17:47,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 23:17:47,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 23:17:47,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 23:17:47,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 23:17:47,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 23:17:47,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 23:17:47,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 23:17:47,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 23:17:47,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 23:17:47,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 23:17:47,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 23:17:47,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 23:17:47,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 23:17:47,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 23:17:47,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 23:17:47,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 23:17:47,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 23:17:47,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 23:17:47,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 23:17:47,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 23:17:47,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 23:17:47,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 23:17:47,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 23:17:47,344 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 23:17:47,348 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:17:47,400 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 23:17:47,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 23:17:47,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 23:17:47,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 23:17:47,405 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 23:17:47,405 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 23:17:47,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 23:17:47,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 23:17:47,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 23:17:47,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 23:17:47,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 23:17:47,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 23:17:47,407 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 23:17:47,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 23:17:47,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 23:17:47,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 23:17:47,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 23:17:47,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 23:17:47,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 23:17:47,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 23:17:47,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 23:17:47,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 23:17:47,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 23:17:47,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 23:17:47,410 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 23:17:47,410 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:17:47,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 23:17:47,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 23:17:47,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 23:17:47,832 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 23:17:47,835 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 23:17:47,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix024_rmo.opt.i [2021-01-06 23:17:47,926 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e3d85451f/916c0ae9980a4602ab660d540dc4bbcc/FLAG119bcebd0 [2021-01-06 23:17:48,578 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 23:17:48,579 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix024_rmo.opt.i [2021-01-06 23:17:48,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e3d85451f/916c0ae9980a4602ab660d540dc4bbcc/FLAG119bcebd0 [2021-01-06 23:17:48,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e3d85451f/916c0ae9980a4602ab660d540dc4bbcc [2021-01-06 23:17:48,870 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 23:17:48,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 23:17:48,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 23:17:48,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 23:17:48,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 23:17:48,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:17:48" (1/1) ... [2021-01-06 23:17:48,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655a02b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:48, skipping insertion in model container [2021-01-06 23:17:48,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 11:17:48" (1/1) ... [2021-01-06 23:17:48,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 23:17:48,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 23:17:49,155 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/mix024_rmo.opt.i[991,1004] 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[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2021-01-06 23:17:49,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:17:49,496 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 23:17:49,511 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/mix024_rmo.opt.i[991,1004] 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[~__unbuffered_p0_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p0_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EAX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_p2_EBX~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] [2021-01-06 23:17:49,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 23:17:49,665 INFO L208 MainTranslator]: Completed translation [2021-01-06 23:17:49,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:49 WrapperNode [2021-01-06 23:17:49,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 23:17:49,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 23:17:49,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 23:17:49,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 23:17:49,677 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:17:49" (1/1) ... [2021-01-06 23:17:49,698 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:17:49" (1/1) ... [2021-01-06 23:17:49,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 23:17:49,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 23:17:49,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 23:17:49,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 23:17:49,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:49" (1/1) ... [2021-01-06 23:17:49,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:49" (1/1) ... [2021-01-06 23:17:49,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:49" (1/1) ... [2021-01-06 23:17:49,764 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:49" (1/1) ... [2021-01-06 23:17:49,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:49" (1/1) ... [2021-01-06 23:17:49,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:49" (1/1) ... [2021-01-06 23:17:49,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:49" (1/1) ... [2021-01-06 23:17:49,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 23:17:49,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 23:17:49,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 23:17:49,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 23:17:49,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:49" (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:17:49,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 23:17:49,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-01-06 23:17:49,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 23:17:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 23:17:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-01-06 23:17:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-01-06 23:17:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-01-06 23:17:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-01-06 23:17:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-01-06 23:17:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-01-06 23:17:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 23:17:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-01-06 23:17:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 23:17:49,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 23:17:49,986 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:17:52,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 23:17:52,312 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-01-06 23:17:52,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:17:52 BoogieIcfgContainer [2021-01-06 23:17:52,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 23:17:52,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 23:17:52,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 23:17:52,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 23:17:52,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 11:17:48" (1/3) ... [2021-01-06 23:17:52,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799758f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:17:52, skipping insertion in model container [2021-01-06 23:17:52,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 11:17:49" (2/3) ... [2021-01-06 23:17:52,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799758f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 11:17:52, skipping insertion in model container [2021-01-06 23:17:52,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:17:52" (3/3) ... [2021-01-06 23:17:52,325 INFO L111 eAbstractionObserver]: Analyzing ICFG mix024_rmo.opt.i [2021-01-06 23:17:52,332 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-01-06 23:17:52,333 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 23:17:52,338 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 23:17:52,339 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-01-06 23:17:52,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,378 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,378 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,379 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,379 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,382 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,384 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,385 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,390 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,391 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,392 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,393 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,398 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,398 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,398 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,398 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,399 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,404 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,404 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,405 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,405 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,408 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,411 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,413 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,414 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,415 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,417 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,418 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,418 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,421 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,422 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,422 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,422 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,423 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-01-06 23:17:52,424 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-01-06 23:17:52,449 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-01-06 23:17:52,471 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 23:17:52,472 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 23:17:52,472 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 23:17:52,472 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 23:17:52,472 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 23:17:52,472 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 23:17:52,472 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 23:17:52,472 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 23:17:52,486 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-01-06 23:17:52,488 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 221 flow [2021-01-06 23:17:52,491 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 221 flow [2021-01-06 23:17:52,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 221 flow [2021-01-06 23:17:52,545 INFO L129 PetriNetUnfolder]: 2/100 cut-off events. [2021-01-06 23:17:52,546 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-01-06 23:17:52,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 100 events. 2/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-01-06 23:17:52,555 INFO L116 LiptonReduction]: Number of co-enabled transitions 1872 [2021-01-06 23:17:53,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:53,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:53,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:17:53,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:53,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:17:53,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:53,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:17:53,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:53,568 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:53,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:53,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:53,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:53,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:53,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:53,677 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:53,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:17:53,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:53,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:54,018 WARN L197 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-01-06 23:17:54,152 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-01-06 23:17:54,734 WARN L197 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-01-06 23:17:54,936 WARN L197 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-01-06 23:17:55,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:55,257 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:55,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:17:55,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:55,284 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:17:55,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:55,286 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:17:55,287 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:55,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:55,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:55,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:55,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:55,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:55,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:55,377 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:55,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:17:55,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:55,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:55,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:55,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 23:17:55,513 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:55,514 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:55,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:55,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:55,579 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:17:55,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:55,581 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:17:55,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:55,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:17:55,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:55,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:55,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:55,587 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:55,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:55,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:55,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:56,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:56,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 23:17:56,347 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:56,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:56,399 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:56,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:56,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:17:56,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:56,403 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:17:56,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:56,405 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:17:56,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:56,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:56,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:56,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:56,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:56,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:56,412 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:56,576 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-06 23:17:56,904 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 23:17:57,138 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-01-06 23:17:57,187 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,188 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,189 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,191 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,191 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:57,193 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:17:57,193 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:57,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,220 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:57,222 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:17:57,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:57,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:17:57,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:57,400 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-01-06 23:17:57,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:57,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-01-06 23:17:57,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 23:17:57,404 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:57,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:57,405 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:57,406 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:57,407 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:57,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:57,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:57,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 23:17:57,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:57,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,503 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,503 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,505 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:57,507 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:17:57,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:57,528 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,531 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:57,533 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:17:57,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:57,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:57,615 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:17:57,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:57,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:57,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:57,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:57,642 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:17:57,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:57,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-01-06 23:17:57,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-01-06 23:17:58,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,167 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:58,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-01-06 23:17:58,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,308 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,313 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:17:58,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,336 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,338 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:58,341 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:17:58,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:58,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-01-06 23:17:58,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,596 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,601 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:58,604 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:17:58,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:58,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,635 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:17:58,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,692 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-01-06 23:17:58,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-01-06 23:17:58,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,696 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-01-06 23:17:58,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,927 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,928 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,930 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:58,932 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:17:58,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:58,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:58,959 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:58,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:58,962 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:17:58,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:59,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:59,007 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:17:59,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:59,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,036 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:59,038 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:17:59,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:59,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2021-01-06 23:17:59,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,142 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,143 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:59,147 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:17:59,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:59,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,169 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,170 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,171 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,172 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:59,174 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:17:59,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:59,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:59,594 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:17:59,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:59,612 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,613 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:59,617 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:17:59,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:59,733 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,734 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,736 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:59,738 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:17:59,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:17:59,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,758 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:17:59,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:17:59,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:59,762 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:17:59,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:17:59,911 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-01-06 23:18:00,123 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-01-06 23:18:00,194 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:18:00,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:18:00,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:18:00,195 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:18:00,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:18:00,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:18:00,199 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:18:00,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 23:18:00,224 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:18:00,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:18:00,225 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:18:00,225 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 23:18:00,227 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-01-06 23:18:00,227 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:18:00,229 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:18:00,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 23:18:00,654 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-01-06 23:18:01,755 WARN L197 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-01-06 23:18:02,009 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-01-06 23:18:02,512 WARN L197 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2021-01-06 23:18:02,762 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2021-01-06 23:18:02,822 INFO L131 LiptonReduction]: Checked pairs total: 4910 [2021-01-06 23:18:02,822 INFO L133 LiptonReduction]: Total number of compositions: 88 [2021-01-06 23:18:02,829 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 27 transitions, 69 flow [2021-01-06 23:18:02,893 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 972 states. [2021-01-06 23:18:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states. [2021-01-06 23:18:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-06 23:18:02,901 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:02,902 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-06 23:18:02,902 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:02,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:02,908 INFO L82 PathProgramCache]: Analyzing trace with hash 948665795, now seen corresponding path program 1 times [2021-01-06 23:18:02,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:02,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196410985] [2021-01-06 23:18:02,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:18:03,174 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:18:03,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196410985] [2021-01-06 23:18:03,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:18:03,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:18:03,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143304714] [2021-01-06 23:18:03,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:18:03,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:18:03,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:18:03,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:18:03,208 INFO L87 Difference]: Start difference. First operand 972 states. Second operand 3 states. [2021-01-06 23:18:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:18:03,332 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2021-01-06 23:18:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:18:03,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-06 23:18:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:18:03,360 INFO L225 Difference]: With dead ends: 812 [2021-01-06 23:18:03,361 INFO L226 Difference]: Without dead ends: 662 [2021-01-06 23:18:03,363 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:18:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2021-01-06 23:18:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2021-01-06 23:18:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2021-01-06 23:18:03,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 2060 transitions. [2021-01-06 23:18:03,536 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 2060 transitions. Word has length 5 [2021-01-06 23:18:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:18:03,536 INFO L481 AbstractCegarLoop]: Abstraction has 662 states and 2060 transitions. [2021-01-06 23:18:03,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:18:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 2060 transitions. [2021-01-06 23:18:03,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-01-06 23:18:03,538 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:03,538 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:18:03,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 23:18:03,539 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:03,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:03,540 INFO L82 PathProgramCache]: Analyzing trace with hash -374209554, now seen corresponding path program 1 times [2021-01-06 23:18:03,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:03,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091832034] [2021-01-06 23:18:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:18:03,670 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:18:03,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091832034] [2021-01-06 23:18:03,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:18:03,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:18:03,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562145558] [2021-01-06 23:18:03,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:18:03,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:18:03,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:18:03,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:18:03,675 INFO L87 Difference]: Start difference. First operand 662 states and 2060 transitions. Second operand 3 states. [2021-01-06 23:18:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:18:03,693 INFO L93 Difference]: Finished difference Result 652 states and 2022 transitions. [2021-01-06 23:18:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:18:03,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2021-01-06 23:18:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:18:03,719 INFO L225 Difference]: With dead ends: 652 [2021-01-06 23:18:03,719 INFO L226 Difference]: Without dead ends: 652 [2021-01-06 23:18:03,720 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:18:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2021-01-06 23:18:03,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2021-01-06 23:18:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2021-01-06 23:18:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 2022 transitions. [2021-01-06 23:18:03,770 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 2022 transitions. Word has length 9 [2021-01-06 23:18:03,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:18:03,771 INFO L481 AbstractCegarLoop]: Abstraction has 652 states and 2022 transitions. [2021-01-06 23:18:03,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:18:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 2022 transitions. [2021-01-06 23:18:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-06 23:18:03,774 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:03,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:18:03,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 23:18:03,774 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:03,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1284405182, now seen corresponding path program 1 times [2021-01-06 23:18:03,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:03,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524135148] [2021-01-06 23:18:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:18:03,855 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:18:03,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524135148] [2021-01-06 23:18:03,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:18:03,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:18:03,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702930517] [2021-01-06 23:18:03,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:18:03,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:18:03,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:18:03,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:18:03,858 INFO L87 Difference]: Start difference. First operand 652 states and 2022 transitions. Second operand 3 states. [2021-01-06 23:18:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:18:03,870 INFO L93 Difference]: Finished difference Result 612 states and 1880 transitions. [2021-01-06 23:18:03,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:18:03,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2021-01-06 23:18:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:18:03,876 INFO L225 Difference]: With dead ends: 612 [2021-01-06 23:18:03,876 INFO L226 Difference]: Without dead ends: 612 [2021-01-06 23:18:03,877 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:18:03,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-01-06 23:18:03,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2021-01-06 23:18:03,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2021-01-06 23:18:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1880 transitions. [2021-01-06 23:18:03,905 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1880 transitions. Word has length 10 [2021-01-06 23:18:03,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:18:03,905 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 1880 transitions. [2021-01-06 23:18:03,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:18:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1880 transitions. [2021-01-06 23:18:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-06 23:18:03,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:03,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:18:03,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 23:18:03,908 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:03,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:03,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1161853206, now seen corresponding path program 1 times [2021-01-06 23:18:03,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:03,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190710086] [2021-01-06 23:18:03,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:18:03,983 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:18:03,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190710086] [2021-01-06 23:18:03,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:18:03,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-01-06 23:18:03,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479737518] [2021-01-06 23:18:03,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 23:18:03,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:18:03,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 23:18:03,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 23:18:03,986 INFO L87 Difference]: Start difference. First operand 612 states and 1880 transitions. Second operand 3 states. [2021-01-06 23:18:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:18:04,006 INFO L93 Difference]: Finished difference Result 572 states and 1738 transitions. [2021-01-06 23:18:04,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 23:18:04,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2021-01-06 23:18:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:18:04,011 INFO L225 Difference]: With dead ends: 572 [2021-01-06 23:18:04,012 INFO L226 Difference]: Without dead ends: 572 [2021-01-06 23:18:04,012 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:18:04,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2021-01-06 23:18:04,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2021-01-06 23:18:04,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2021-01-06 23:18:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1738 transitions. [2021-01-06 23:18:04,038 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1738 transitions. Word has length 11 [2021-01-06 23:18:04,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:18:04,038 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 1738 transitions. [2021-01-06 23:18:04,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 23:18:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1738 transitions. [2021-01-06 23:18:04,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-01-06 23:18:04,041 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:04,041 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:18:04,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 23:18:04,042 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:04,042 INFO L82 PathProgramCache]: Analyzing trace with hash 931855802, now seen corresponding path program 1 times [2021-01-06 23:18:04,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:04,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279894132] [2021-01-06 23:18:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:18:04,177 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:18:04,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279894132] [2021-01-06 23:18:04,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:18:04,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:18:04,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068704558] [2021-01-06 23:18:04,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:18:04,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:18:04,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:18:04,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:18:04,182 INFO L87 Difference]: Start difference. First operand 572 states and 1738 transitions. Second operand 4 states. [2021-01-06 23:18:04,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:18:04,234 INFO L93 Difference]: Finished difference Result 538 states and 1447 transitions. [2021-01-06 23:18:04,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:18:04,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2021-01-06 23:18:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:18:04,239 INFO L225 Difference]: With dead ends: 538 [2021-01-06 23:18:04,239 INFO L226 Difference]: Without dead ends: 388 [2021-01-06 23:18:04,239 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:18:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2021-01-06 23:18:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2021-01-06 23:18:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2021-01-06 23:18:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 1002 transitions. [2021-01-06 23:18:04,253 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 1002 transitions. Word has length 13 [2021-01-06 23:18:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:18:04,253 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 1002 transitions. [2021-01-06 23:18:04,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:18:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 1002 transitions. [2021-01-06 23:18:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-06 23:18:04,255 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:04,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:18:04,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 23:18:04,255 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:04,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:04,256 INFO L82 PathProgramCache]: Analyzing trace with hash 943755432, now seen corresponding path program 1 times [2021-01-06 23:18:04,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:04,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218518520] [2021-01-06 23:18:04,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:18:04,405 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:18:04,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218518520] [2021-01-06 23:18:04,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:18:04,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 23:18:04,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888255682] [2021-01-06 23:18:04,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 23:18:04,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:18:04,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 23:18:04,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 23:18:04,410 INFO L87 Difference]: Start difference. First operand 388 states and 1002 transitions. Second operand 5 states. [2021-01-06 23:18:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:18:04,478 INFO L93 Difference]: Finished difference Result 320 states and 769 transitions. [2021-01-06 23:18:04,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:18:04,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2021-01-06 23:18:04,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:18:04,481 INFO L225 Difference]: With dead ends: 320 [2021-01-06 23:18:04,482 INFO L226 Difference]: Without dead ends: 250 [2021-01-06 23:18:04,482 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:18:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-01-06 23:18:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2021-01-06 23:18:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2021-01-06 23:18:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 588 transitions. [2021-01-06 23:18:04,491 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 588 transitions. Word has length 15 [2021-01-06 23:18:04,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:18:04,491 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 588 transitions. [2021-01-06 23:18:04,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 23:18:04,491 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 588 transitions. [2021-01-06 23:18:04,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:18:04,493 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:04,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:18:04,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 23:18:04,493 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:04,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1899543857, now seen corresponding path program 1 times [2021-01-06 23:18:04,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:04,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790347267] [2021-01-06 23:18:04,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:18:04,664 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:18:04,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790347267] [2021-01-06 23:18:04,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:18:04,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:18:04,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009544651] [2021-01-06 23:18:04,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:18:04,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:18:04,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:18:04,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:18:04,667 INFO L87 Difference]: Start difference. First operand 250 states and 588 transitions. Second operand 4 states. [2021-01-06 23:18:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:18:04,719 INFO L93 Difference]: Finished difference Result 409 states and 937 transitions. [2021-01-06 23:18:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 23:18:04,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2021-01-06 23:18:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:18:04,723 INFO L225 Difference]: With dead ends: 409 [2021-01-06 23:18:04,723 INFO L226 Difference]: Without dead ends: 351 [2021-01-06 23:18:04,723 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:18:04,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2021-01-06 23:18:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 257. [2021-01-06 23:18:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2021-01-06 23:18:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 581 transitions. [2021-01-06 23:18:04,735 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 581 transitions. Word has length 18 [2021-01-06 23:18:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:18:04,735 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 581 transitions. [2021-01-06 23:18:04,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:18:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 581 transitions. [2021-01-06 23:18:04,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:18:04,736 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:04,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:18:04,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 23:18:04,737 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:04,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:04,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1713647327, now seen corresponding path program 2 times [2021-01-06 23:18:04,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:04,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520449357] [2021-01-06 23:18:04,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:18:04,815 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:18:04,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520449357] [2021-01-06 23:18:04,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:18:04,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 23:18:04,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150542313] [2021-01-06 23:18:04,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 23:18:04,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:18:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 23:18:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 23:18:04,817 INFO L87 Difference]: Start difference. First operand 257 states and 581 transitions. Second operand 4 states. [2021-01-06 23:18:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:18:04,836 INFO L93 Difference]: Finished difference Result 351 states and 771 transitions. [2021-01-06 23:18:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 23:18:04,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2021-01-06 23:18:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:18:04,839 INFO L225 Difference]: With dead ends: 351 [2021-01-06 23:18:04,839 INFO L226 Difference]: Without dead ends: 260 [2021-01-06 23:18:04,839 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:18:04,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-01-06 23:18:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2021-01-06 23:18:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2021-01-06 23:18:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 571 transitions. [2021-01-06 23:18:04,848 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 571 transitions. Word has length 18 [2021-01-06 23:18:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:18:04,848 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 571 transitions. [2021-01-06 23:18:04,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 23:18:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 571 transitions. [2021-01-06 23:18:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-06 23:18:04,849 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:04,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:18:04,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 23:18:04,850 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:04,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:04,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1495976183, now seen corresponding path program 3 times [2021-01-06 23:18:04,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:04,851 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146947829] [2021-01-06 23:18:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:18:04,956 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:18:04,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146947829] [2021-01-06 23:18:04,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:18:04,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 23:18:04,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24241210] [2021-01-06 23:18:04,957 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 23:18:04,957 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:18:04,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 23:18:04,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-06 23:18:04,958 INFO L87 Difference]: Start difference. First operand 257 states and 571 transitions. Second operand 6 states. [2021-01-06 23:18:05,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:18:05,011 INFO L93 Difference]: Finished difference Result 235 states and 527 transitions. [2021-01-06 23:18:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 23:18:05,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2021-01-06 23:18:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:18:05,012 INFO L225 Difference]: With dead ends: 235 [2021-01-06 23:18:05,013 INFO L226 Difference]: Without dead ends: 104 [2021-01-06 23:18:05,013 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:18:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-06 23:18:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2021-01-06 23:18:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2021-01-06 23:18:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 190 transitions. [2021-01-06 23:18:05,017 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 190 transitions. Word has length 18 [2021-01-06 23:18:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:18:05,017 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 190 transitions. [2021-01-06 23:18:05,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 23:18:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 190 transitions. [2021-01-06 23:18:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:18:05,018 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:05,018 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:18:05,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 23:18:05,019 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:05,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2013545093, now seen corresponding path program 1 times [2021-01-06 23:18:05,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:05,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863066746] [2021-01-06 23:18:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 23:18:05,368 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:18:05,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863066746] [2021-01-06 23:18:05,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 23:18:05,369 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 23:18:05,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720058030] [2021-01-06 23:18:05,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 23:18:05,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 23:18:05,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 23:18:05,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-01-06 23:18:05,370 INFO L87 Difference]: Start difference. First operand 95 states and 190 transitions. Second operand 7 states. [2021-01-06 23:18:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 23:18:05,501 INFO L93 Difference]: Finished difference Result 109 states and 212 transitions. [2021-01-06 23:18:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 23:18:05,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2021-01-06 23:18:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 23:18:05,502 INFO L225 Difference]: With dead ends: 109 [2021-01-06 23:18:05,502 INFO L226 Difference]: Without dead ends: 67 [2021-01-06 23:18:05,503 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 23:18:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2021-01-06 23:18:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2021-01-06 23:18:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2021-01-06 23:18:05,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2021-01-06 23:18:05,506 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 22 [2021-01-06 23:18:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 23:18:05,506 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2021-01-06 23:18:05,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 23:18:05,506 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2021-01-06 23:18:05,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-06 23:18:05,507 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 23:18:05,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 23:18:05,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 23:18:05,507 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 23:18:05,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 23:18:05,508 INFO L82 PathProgramCache]: Analyzing trace with hash 599323685, now seen corresponding path program 2 times [2021-01-06 23:18:05,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 23:18:05,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46552219] [2021-01-06 23:18:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 23:18:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:18:05,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:18:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 23:18:05,694 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 23:18:05,764 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 23:18:05,765 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 23:18:05,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 23:18:05,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 11:18:05 BasicIcfg [2021-01-06 23:18:05,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 23:18:05,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 23:18:05,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 23:18:05,922 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 23:18:05,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 11:17:52" (3/4) ... [2021-01-06 23:18:05,925 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 23:18:06,066 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix024_rmo.opt.i-witness.graphml [2021-01-06 23:18:06,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 23:18:06,067 INFO L168 Benchmark]: Toolchain (without parser) took 17194.93 ms. Allocated memory was 156.2 MB in the beginning and 367.0 MB in the end (delta: 210.8 MB). Free memory was 129.8 MB in the beginning and 250.9 MB in the end (delta: -121.1 MB). Peak memory consumption was 90.2 MB. Max. memory is 8.0 GB. [2021-01-06 23:18:06,068 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 156.2 MB. Free memory is still 130.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 23:18:06,068 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.40 ms. Allocated memory is still 156.2 MB. Free memory was 129.5 MB in the beginning and 95.0 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. [2021-01-06 23:18:06,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.41 ms. Allocated memory is still 156.2 MB. Free memory was 95.0 MB in the beginning and 92.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:18:06,069 INFO L168 Benchmark]: Boogie Preprocessor took 47.13 ms. Allocated memory is still 156.2 MB. Free memory was 92.6 MB in the beginning and 90.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 23:18:06,069 INFO L168 Benchmark]: RCFGBuilder took 2524.40 ms. Allocated memory was 156.2 MB in the beginning and 187.7 MB in the end (delta: 31.5 MB). Free memory was 90.5 MB in the beginning and 148.7 MB in the end (delta: -58.2 MB). Peak memory consumption was 62.9 MB. Max. memory is 8.0 GB. [2021-01-06 23:18:06,069 INFO L168 Benchmark]: TraceAbstraction took 13604.01 ms. Allocated memory was 187.7 MB in the beginning and 367.0 MB in the end (delta: 179.3 MB). Free memory was 148.2 MB in the beginning and 268.2 MB in the end (delta: -120.0 MB). Peak memory consumption was 59.8 MB. Max. memory is 8.0 GB. [2021-01-06 23:18:06,070 INFO L168 Benchmark]: Witness Printer took 144.30 ms. Allocated memory is still 367.0 MB. Free memory was 267.7 MB in the beginning and 250.9 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-01-06 23:18:06,073 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.19 ms. Allocated memory is still 156.2 MB. Free memory is still 130.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 789.40 ms. Allocated memory is still 156.2 MB. Free memory was 129.5 MB in the beginning and 95.0 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 75.41 ms. Allocated memory is still 156.2 MB. Free memory was 95.0 MB in the beginning and 92.6 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.13 ms. Allocated memory is still 156.2 MB. Free memory was 92.6 MB in the beginning and 90.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2524.40 ms. Allocated memory was 156.2 MB in the beginning and 187.7 MB in the end (delta: 31.5 MB). Free memory was 90.5 MB in the beginning and 148.7 MB in the end (delta: -58.2 MB). Peak memory consumption was 62.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13604.01 ms. Allocated memory was 187.7 MB in the beginning and 367.0 MB in the end (delta: 179.3 MB). Free memory was 148.2 MB in the beginning and 268.2 MB in the end (delta: -120.0 MB). Peak memory consumption was 59.8 MB. Max. memory is 8.0 GB. * Witness Printer took 144.30 ms. Allocated memory is still 367.0 MB. Free memory was 267.7 MB in the beginning and 250.9 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1240 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 63 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.7s, 150 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.3s, 111 PlacesBefore, 37 PlacesAfterwards, 103 TransitionsBefore, 27 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 4910 MoverChecksTotal - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t648; [L845] FCALL, FORK 0 pthread_create(&t648, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t649; [L847] FCALL, FORK 0 pthread_create(&t649, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L848] 0 pthread_t t650; [L849] FCALL, FORK 0 pthread_create(&t650, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 x = 1 [L756] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L768] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1) [L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 102 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.2s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.4s, HoareTripleCheckerStatistics: 285 SDtfs, 251 SDslu, 420 SDs, 0 SdLazy, 159 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=972occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 106 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 15309 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...