/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/safe030_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 13:45:20,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 13:45:20,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 13:45:20,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 13:45:20,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 13:45:20,372 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 13:45:20,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 13:45:20,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 13:45:20,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 13:45:20,393 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 13:45:20,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 13:45:20,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 13:45:20,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 13:45:20,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 13:45:20,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 13:45:20,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 13:45:20,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 13:45:20,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 13:45:20,430 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 13:45:20,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 13:45:20,440 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 13:45:20,444 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 13:45:20,449 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 13:45:20,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 13:45:20,457 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 13:45:20,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 13:45:20,458 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 13:45:20,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 13:45:20,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 13:45:20,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 13:45:20,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 13:45:20,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 13:45:20,473 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 13:45:20,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 13:45:20,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 13:45:20,482 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 13:45:20,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 13:45:20,488 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 13:45:20,488 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 13:45:20,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 13:45:20,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 13:45:20,495 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 13:45:20,544 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 13:45:20,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 13:45:20,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 13:45:20,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 13:45:20,550 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 13:45:20,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 13:45:20,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 13:45:20,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 13:45:20,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 13:45:20,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 13:45:20,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 13:45:20,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 13:45:20,553 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 13:45:20,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 13:45:20,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 13:45:20,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 13:45:20,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 13:45:20,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 13:45:20,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 13:45:20,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 13:45:20,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 13:45:20,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 13:45:20,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 13:45:20,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 13:45:20,556 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 13:45:20,556 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 [2020-12-23 13:45:20,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 13:45:20,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 13:45:20,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 13:45:20,998 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 13:45:20,999 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 13:45:21,000 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.opt.i [2020-12-23 13:45:21,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b8ee559eb/b67ae82358db44b69a8108ec91ac607b/FLAG569d49079 [2020-12-23 13:45:21,895 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 13:45:21,896 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.opt.i [2020-12-23 13:45:21,924 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b8ee559eb/b67ae82358db44b69a8108ec91ac607b/FLAG569d49079 [2020-12-23 13:45:22,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b8ee559eb/b67ae82358db44b69a8108ec91ac607b [2020-12-23 13:45:22,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 13:45:22,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 13:45:22,134 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 13:45:22,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 13:45:22,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 13:45:22,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:22,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@480aed36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22, skipping insertion in model container [2020-12-23 13:45:22,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:22,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 13:45:22,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 13:45:22,396 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/safe030_power.opt.i[951,964] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$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_thd3~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_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] [2020-12-23 13:45:22,723 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:45:22,735 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 13:45:22,761 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/safe030_power.opt.i[951,964] left hand side expression in assignment: lhs: VariableLHS[~z~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~x~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$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_thd3~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_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__unbuffered_cnt~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~weak$$choice2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$mem_tmp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff0_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$w_buff1_used~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff0_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$r_buff1_thd0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~main$tmp_guard1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~y$flush_delayed~0,GLOBAL] [2020-12-23 13:45:22,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 13:45:22,939 INFO L208 MainTranslator]: Completed translation [2020-12-23 13:45:22,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22 WrapperNode [2020-12-23 13:45:22,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 13:45:22,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 13:45:22,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 13:45:22,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 13:45:22,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:22,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:23,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 13:45:23,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 13:45:23,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 13:45:23,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 13:45:23,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:23,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:23,033 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:23,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:23,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:23,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:23,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (1/1) ... [2020-12-23 13:45:23,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 13:45:23,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 13:45:23,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 13:45:23,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 13:45:23,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (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 [2020-12-23 13:45:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-23 13:45:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-23 13:45:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 13:45:23,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-23 13:45:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-23 13:45:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-23 13:45:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-23 13:45:23,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-23 13:45:23,220 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-23 13:45:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-23 13:45:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 13:45:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-23 13:45:23,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 13:45:23,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 13:45:23,223 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-23 13:45:25,368 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 13:45:25,368 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-23 13:45:25,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:45:25 BoogieIcfgContainer [2020-12-23 13:45:25,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 13:45:25,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 13:45:25,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 13:45:25,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 13:45:25,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 01:45:22" (1/3) ... [2020-12-23 13:45:25,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc6043f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:45:25, skipping insertion in model container [2020-12-23 13:45:25,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 01:45:22" (2/3) ... [2020-12-23 13:45:25,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc6043f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 01:45:25, skipping insertion in model container [2020-12-23 13:45:25,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:45:25" (3/3) ... [2020-12-23 13:45:25,380 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2020-12-23 13:45:25,388 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-23 13:45:25,388 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 13:45:25,393 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 13:45:25,394 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-23 13:45:25,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,431 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,431 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,432 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,432 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,433 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,433 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,434 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,434 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,434 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,434 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,435 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,439 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,439 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,440 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,440 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,440 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,440 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,441 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,441 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,441 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,442 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,442 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,449 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,449 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,451 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,452 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,456 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,457 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,457 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-23 13:45:25,459 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-23 13:45:25,479 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-23 13:45:25,503 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 13:45:25,504 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 13:45:25,504 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 13:45:25,504 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 13:45:25,504 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 13:45:25,504 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 13:45:25,505 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 13:45:25,505 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 13:45:25,546 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-23 13:45:25,548 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 95 transitions, 205 flow [2020-12-23 13:45:25,552 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 95 transitions, 205 flow [2020-12-23 13:45:25,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2020-12-23 13:45:25,616 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2020-12-23 13:45:25,616 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-23 13:45:25,621 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-12-23 13:45:25,627 INFO L116 LiptonReduction]: Number of co-enabled transitions 1578 [2020-12-23 13:45:25,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-23 13:45:25,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:26,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-23 13:45:26,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:26,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-23 13:45:26,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:26,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:45:26,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:26,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:26,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:26,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:26,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:27,184 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-23 13:45:27,293 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-23 13:45:27,837 WARN L197 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-23 13:45:28,015 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-23 13:45:28,438 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:28,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:28,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:28,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:28,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,523 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-23 13:45:28,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-23 13:45:28,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-23 13:45:28,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,573 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:28,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:28,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-23 13:45:28,617 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:28,618 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:45:28,619 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:28,694 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:28,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,696 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:28,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-23 13:45:28,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:45:28,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-23 13:45:28,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:28,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:28,775 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:28,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,776 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:28,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:28,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:28,783 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:28,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:28,785 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:28,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:28,789 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:28,789 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,791 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:28,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,794 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:28,795 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,902 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:28,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,904 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:28,904 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:28,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-23 13:45:28,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:28,940 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-23 13:45:28,940 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:29,011 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:29,014 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,014 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,015 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,019 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:29,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:29,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:29,027 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:29,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,029 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:29,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,031 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:29,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:29,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:29,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,107 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-23 13:45:29,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:45:29,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-23 13:45:29,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,347 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:29,347 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:29,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-23 13:45:29,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:45:29,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-23 13:45:29,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:29,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:29,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:29,453 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:29,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:29,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:29,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:29,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,462 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:29,463 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:29,654 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-23 13:45:29,761 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-23 13:45:29,954 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 13:45:30,160 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-23 13:45:30,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:30,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-23 13:45:30,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,505 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:30,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,506 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:30,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,546 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:30,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:30,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,584 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-23 13:45:30,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:30,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:45:30,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:30,627 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:30,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,629 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-12-23 13:45:30,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,662 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:30,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:30,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-23 13:45:30,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:30,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-12-23 13:45:30,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:30,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:30,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:30,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-23 13:45:30,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:30,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-23 13:45:30,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:30,911 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:30,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:30,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:30,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:31,016 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,018 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,022 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:31,024 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:31,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-23 13:45:31,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:31,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,033 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:31,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,035 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-12-23 13:45:31,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,107 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-23 13:45:31,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-23 13:45:31,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,112 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-23 13:45:31,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-23 13:45:31,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-12-23 13:45:31,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:31,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:31,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:45:31,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:45:31,340 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:31,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,342 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:31,344 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:31,616 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:31,617 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:31,640 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:31,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:31,644 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:45:31,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:31,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:45:32,058 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,058 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:32,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:32,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:45:32,063 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,064 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:45:32,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:32,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:32,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,085 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:32,086 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:32,121 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:32,122 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:32,124 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:32,126 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-23 13:45:32,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:32,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-23 13:45:32,148 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:45:32,150 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-23 13:45:32,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-23 13:45:32,542 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-23 13:45:32,710 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-12-23 13:45:32,976 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-12-23 13:45:33,177 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-12-23 13:45:33,908 WARN L197 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-12-23 13:45:34,114 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-23 13:45:34,547 WARN L197 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2020-12-23 13:45:34,751 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-12-23 13:45:34,763 INFO L131 LiptonReduction]: Checked pairs total: 3915 [2020-12-23 13:45:34,763 INFO L133 LiptonReduction]: Total number of compositions: 80 [2020-12-23 13:45:34,771 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-12-23 13:45:34,828 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 770 states. [2020-12-23 13:45:34,830 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states. [2020-12-23 13:45:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-12-23 13:45:34,836 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:34,837 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:34,838 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:34,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:34,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1491491518, now seen corresponding path program 1 times [2020-12-23 13:45:34,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:34,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442216147] [2020-12-23 13:45:34,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:35,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:35,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442216147] [2020-12-23 13:45:35,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:35,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-23 13:45:35,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164200052] [2020-12-23 13:45:35,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 13:45:35,245 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:35,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 13:45:35,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 13:45:35,264 INFO L87 Difference]: Start difference. First operand 770 states. Second operand 3 states. [2020-12-23 13:45:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:35,375 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-12-23 13:45:35,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 13:45:35,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-12-23 13:45:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:35,417 INFO L225 Difference]: With dead ends: 650 [2020-12-23 13:45:35,417 INFO L226 Difference]: Without dead ends: 550 [2020-12-23 13:45:35,419 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 [2020-12-23 13:45:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-12-23 13:45:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-12-23 13:45:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-12-23 13:45:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-12-23 13:45:35,566 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2020-12-23 13:45:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:35,568 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-12-23 13:45:35,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 13:45:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-12-23 13:45:35,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-23 13:45:35,570 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:35,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:35,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 13:45:35,571 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:35,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:35,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1589045551, now seen corresponding path program 1 times [2020-12-23 13:45:35,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:35,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613608691] [2020-12-23 13:45:35,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:35,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613608691] [2020-12-23 13:45:35,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:35,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 13:45:35,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596769755] [2020-12-23 13:45:35,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:45:35,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:35,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:45:35,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:45:35,765 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-12-23 13:45:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:35,829 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2020-12-23 13:45:35,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:45:35,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-23 13:45:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:35,837 INFO L225 Difference]: With dead ends: 630 [2020-12-23 13:45:35,838 INFO L226 Difference]: Without dead ends: 530 [2020-12-23 13:45:35,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:45:35,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-12-23 13:45:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-12-23 13:45:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-12-23 13:45:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2020-12-23 13:45:35,864 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2020-12-23 13:45:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:35,864 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2020-12-23 13:45:35,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:45:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2020-12-23 13:45:35,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 13:45:35,875 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:35,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:35,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 13:45:35,875 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2015868599, now seen corresponding path program 1 times [2020-12-23 13:45:35,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:35,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646298770] [2020-12-23 13:45:35,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:36,088 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646298770] [2020-12-23 13:45:36,088 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:36,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 13:45:36,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133270827] [2020-12-23 13:45:36,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:45:36,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:36,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:45:36,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:45:36,091 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand 4 states. [2020-12-23 13:45:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:36,139 INFO L93 Difference]: Finished difference Result 604 states and 1772 transitions. [2020-12-23 13:45:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:45:36,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-12-23 13:45:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:36,144 INFO L225 Difference]: With dead ends: 604 [2020-12-23 13:45:36,145 INFO L226 Difference]: Without dead ends: 514 [2020-12-23 13:45:36,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:45:36,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2020-12-23 13:45:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2020-12-23 13:45:36,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2020-12-23 13:45:36,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1557 transitions. [2020-12-23 13:45:36,161 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1557 transitions. Word has length 11 [2020-12-23 13:45:36,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:36,162 INFO L481 AbstractCegarLoop]: Abstraction has 514 states and 1557 transitions. [2020-12-23 13:45:36,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:45:36,162 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1557 transitions. [2020-12-23 13:45:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 13:45:36,163 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:36,163 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:36,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 13:45:36,164 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:36,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1932541835, now seen corresponding path program 1 times [2020-12-23 13:45:36,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:36,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018502673] [2020-12-23 13:45:36,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:36,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:36,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018502673] [2020-12-23 13:45:36,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:36,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:45:36,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322906925] [2020-12-23 13:45:36,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:45:36,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:36,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:45:36,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:45:36,276 INFO L87 Difference]: Start difference. First operand 514 states and 1557 transitions. Second operand 4 states. [2020-12-23 13:45:36,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:36,329 INFO L93 Difference]: Finished difference Result 800 states and 2294 transitions. [2020-12-23 13:45:36,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:45:36,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-23 13:45:36,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:36,334 INFO L225 Difference]: With dead ends: 800 [2020-12-23 13:45:36,335 INFO L226 Difference]: Without dead ends: 574 [2020-12-23 13:45:36,335 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 [2020-12-23 13:45:36,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2020-12-23 13:45:36,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 494. [2020-12-23 13:45:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2020-12-23 13:45:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1423 transitions. [2020-12-23 13:45:36,354 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1423 transitions. Word has length 12 [2020-12-23 13:45:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:36,354 INFO L481 AbstractCegarLoop]: Abstraction has 494 states and 1423 transitions. [2020-12-23 13:45:36,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:45:36,354 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1423 transitions. [2020-12-23 13:45:36,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-23 13:45:36,355 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:36,356 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:36,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 13:45:36,356 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1932500512, now seen corresponding path program 1 times [2020-12-23 13:45:36,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:36,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409097385] [2020-12-23 13:45:36,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:36,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409097385] [2020-12-23 13:45:36,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:36,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:45:36,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244221896] [2020-12-23 13:45:36,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:45:36,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:36,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:45:36,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:45:36,503 INFO L87 Difference]: Start difference. First operand 494 states and 1423 transitions. Second operand 5 states. [2020-12-23 13:45:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:36,611 INFO L93 Difference]: Finished difference Result 548 states and 1537 transitions. [2020-12-23 13:45:36,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:45:36,612 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-23 13:45:36,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:36,617 INFO L225 Difference]: With dead ends: 548 [2020-12-23 13:45:36,617 INFO L226 Difference]: Without dead ends: 488 [2020-12-23 13:45:36,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:45:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-12-23 13:45:36,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2020-12-23 13:45:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2020-12-23 13:45:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1401 transitions. [2020-12-23 13:45:36,635 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1401 transitions. Word has length 12 [2020-12-23 13:45:36,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:36,636 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 1401 transitions. [2020-12-23 13:45:36,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:45:36,636 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1401 transitions. [2020-12-23 13:45:36,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 13:45:36,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:36,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:36,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 13:45:36,638 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:36,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1901119999, now seen corresponding path program 1 times [2020-12-23 13:45:36,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:36,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153777653] [2020-12-23 13:45:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:36,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153777653] [2020-12-23 13:45:36,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:36,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:45:36,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452550659] [2020-12-23 13:45:36,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:45:36,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:36,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:45:36,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:45:36,715 INFO L87 Difference]: Start difference. First operand 488 states and 1401 transitions. Second operand 4 states. [2020-12-23 13:45:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:36,759 INFO L93 Difference]: Finished difference Result 755 states and 2074 transitions. [2020-12-23 13:45:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:45:36,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-23 13:45:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:36,764 INFO L225 Difference]: With dead ends: 755 [2020-12-23 13:45:36,765 INFO L226 Difference]: Without dead ends: 536 [2020-12-23 13:45:36,765 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 [2020-12-23 13:45:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-12-23 13:45:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 464. [2020-12-23 13:45:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-12-23 13:45:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1274 transitions. [2020-12-23 13:45:36,782 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 1274 transitions. Word has length 13 [2020-12-23 13:45:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:36,782 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 1274 transitions. [2020-12-23 13:45:36,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:45:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 1274 transitions. [2020-12-23 13:45:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 13:45:36,784 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:36,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:36,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 13:45:36,784 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:36,785 INFO L82 PathProgramCache]: Analyzing trace with hash -734667343, now seen corresponding path program 1 times [2020-12-23 13:45:36,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:36,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79913587] [2020-12-23 13:45:36,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:36,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79913587] [2020-12-23 13:45:36,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:36,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:45:36,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866936867] [2020-12-23 13:45:36,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:45:36,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:36,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:45:36,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:45:36,915 INFO L87 Difference]: Start difference. First operand 464 states and 1274 transitions. Second operand 6 states. [2020-12-23 13:45:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:37,051 INFO L93 Difference]: Finished difference Result 500 states and 1340 transitions. [2020-12-23 13:45:37,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:45:37,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-23 13:45:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:37,055 INFO L225 Difference]: With dead ends: 500 [2020-12-23 13:45:37,056 INFO L226 Difference]: Without dead ends: 452 [2020-12-23 13:45:37,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:45:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2020-12-23 13:45:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2020-12-23 13:45:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2020-12-23 13:45:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1230 transitions. [2020-12-23 13:45:37,098 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1230 transitions. Word has length 13 [2020-12-23 13:45:37,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:37,098 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 1230 transitions. [2020-12-23 13:45:37,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:45:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1230 transitions. [2020-12-23 13:45:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 13:45:37,100 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:37,100 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:37,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 13:45:37,100 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:37,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:37,101 INFO L82 PathProgramCache]: Analyzing trace with hash 222073074, now seen corresponding path program 1 times [2020-12-23 13:45:37,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:37,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047105623] [2020-12-23 13:45:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:37,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047105623] [2020-12-23 13:45:37,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:37,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:45:37,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507991181] [2020-12-23 13:45:37,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:45:37,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:37,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:45:37,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:45:37,193 INFO L87 Difference]: Start difference. First operand 452 states and 1230 transitions. Second operand 5 states. [2020-12-23 13:45:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:37,295 INFO L93 Difference]: Finished difference Result 501 states and 1339 transitions. [2020-12-23 13:45:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:45:37,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-23 13:45:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:37,299 INFO L225 Difference]: With dead ends: 501 [2020-12-23 13:45:37,299 INFO L226 Difference]: Without dead ends: 456 [2020-12-23 13:45:37,299 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 [2020-12-23 13:45:37,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2020-12-23 13:45:37,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2020-12-23 13:45:37,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-12-23 13:45:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1240 transitions. [2020-12-23 13:45:37,316 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1240 transitions. Word has length 13 [2020-12-23 13:45:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:37,316 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 1240 transitions. [2020-12-23 13:45:37,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:45:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1240 transitions. [2020-12-23 13:45:37,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-23 13:45:37,318 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:37,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:37,318 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 13:45:37,318 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:37,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:37,319 INFO L82 PathProgramCache]: Analyzing trace with hash -164998506, now seen corresponding path program 2 times [2020-12-23 13:45:37,319 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:37,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588525208] [2020-12-23 13:45:37,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:37,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588525208] [2020-12-23 13:45:37,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:37,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:45:37,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499252925] [2020-12-23 13:45:37,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:45:37,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:37,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:45:37,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:45:37,446 INFO L87 Difference]: Start difference. First operand 456 states and 1240 transitions. Second operand 6 states. [2020-12-23 13:45:37,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:37,561 INFO L93 Difference]: Finished difference Result 483 states and 1285 transitions. [2020-12-23 13:45:37,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:45:37,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-12-23 13:45:37,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:37,566 INFO L225 Difference]: With dead ends: 483 [2020-12-23 13:45:37,566 INFO L226 Difference]: Without dead ends: 438 [2020-12-23 13:45:37,567 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 13:45:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2020-12-23 13:45:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2020-12-23 13:45:37,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-12-23 13:45:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1170 transitions. [2020-12-23 13:45:37,583 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1170 transitions. Word has length 13 [2020-12-23 13:45:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:37,583 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1170 transitions. [2020-12-23 13:45:37,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:45:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1170 transitions. [2020-12-23 13:45:37,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-23 13:45:37,585 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:37,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:37,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 13:45:37,585 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:37,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:37,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1299804351, now seen corresponding path program 1 times [2020-12-23 13:45:37,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:37,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763385289] [2020-12-23 13:45:37,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:37,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:37,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763385289] [2020-12-23 13:45:37,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:37,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:45:37,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419144231] [2020-12-23 13:45:37,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:45:37,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:37,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:45:37,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:45:37,701 INFO L87 Difference]: Start difference. First operand 434 states and 1170 transitions. Second operand 6 states. [2020-12-23 13:45:37,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:37,826 INFO L93 Difference]: Finished difference Result 500 states and 1322 transitions. [2020-12-23 13:45:37,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:45:37,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-23 13:45:37,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:37,830 INFO L225 Difference]: With dead ends: 500 [2020-12-23 13:45:37,830 INFO L226 Difference]: Without dead ends: 458 [2020-12-23 13:45:37,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:45:37,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-12-23 13:45:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 446. [2020-12-23 13:45:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2020-12-23 13:45:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 1190 transitions. [2020-12-23 13:45:37,846 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 1190 transitions. Word has length 14 [2020-12-23 13:45:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:37,846 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 1190 transitions. [2020-12-23 13:45:37,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:45:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 1190 transitions. [2020-12-23 13:45:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-23 13:45:37,848 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:37,848 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:37,848 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 13:45:37,848 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:37,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:37,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1670281230, now seen corresponding path program 1 times [2020-12-23 13:45:37,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:37,849 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627770974] [2020-12-23 13:45:37,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:37,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627770974] [2020-12-23 13:45:37,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:37,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 13:45:37,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945105752] [2020-12-23 13:45:37,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 13:45:37,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:37,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 13:45:37,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 13:45:37,930 INFO L87 Difference]: Start difference. First operand 446 states and 1190 transitions. Second operand 4 states. [2020-12-23 13:45:37,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:37,960 INFO L93 Difference]: Finished difference Result 432 states and 1011 transitions. [2020-12-23 13:45:37,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 13:45:37,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-23 13:45:37,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:37,964 INFO L225 Difference]: With dead ends: 432 [2020-12-23 13:45:37,964 INFO L226 Difference]: Without dead ends: 324 [2020-12-23 13:45:37,964 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 [2020-12-23 13:45:37,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2020-12-23 13:45:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2020-12-23 13:45:37,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2020-12-23 13:45:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 744 transitions. [2020-12-23 13:45:37,975 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 744 transitions. Word has length 15 [2020-12-23 13:45:37,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:37,976 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 744 transitions. [2020-12-23 13:45:37,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 13:45:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 744 transitions. [2020-12-23 13:45:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-23 13:45:37,977 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:37,977 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:37,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 13:45:37,977 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:37,978 INFO L82 PathProgramCache]: Analyzing trace with hash -942899002, now seen corresponding path program 1 times [2020-12-23 13:45:37,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:37,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342568898] [2020-12-23 13:45:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:38,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:38,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342568898] [2020-12-23 13:45:38,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:38,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 13:45:38,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385603890] [2020-12-23 13:45:38,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 13:45:38,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:38,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 13:45:38,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-23 13:45:38,055 INFO L87 Difference]: Start difference. First operand 324 states and 744 transitions. Second operand 5 states. [2020-12-23 13:45:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:38,096 INFO L93 Difference]: Finished difference Result 259 states and 534 transitions. [2020-12-23 13:45:38,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:45:38,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-23 13:45:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:38,098 INFO L225 Difference]: With dead ends: 259 [2020-12-23 13:45:38,098 INFO L226 Difference]: Without dead ends: 186 [2020-12-23 13:45:38,099 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 [2020-12-23 13:45:38,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-12-23 13:45:38,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2020-12-23 13:45:38,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-12-23 13:45:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 354 transitions. [2020-12-23 13:45:38,104 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 354 transitions. Word has length 16 [2020-12-23 13:45:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:38,104 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 354 transitions. [2020-12-23 13:45:38,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 13:45:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 354 transitions. [2020-12-23 13:45:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-23 13:45:38,105 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:38,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 13:45:38,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 13:45:38,106 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:38,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1796959845, now seen corresponding path program 1 times [2020-12-23 13:45:38,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:38,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574908448] [2020-12-23 13:45:38,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:38,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:38,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574908448] [2020-12-23 13:45:38,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:38,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 13:45:38,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535185346] [2020-12-23 13:45:38,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 13:45:38,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:38,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 13:45:38,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-23 13:45:38,218 INFO L87 Difference]: Start difference. First operand 182 states and 354 transitions. Second operand 6 states. [2020-12-23 13:45:38,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:38,305 INFO L93 Difference]: Finished difference Result 155 states and 300 transitions. [2020-12-23 13:45:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 13:45:38,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-23 13:45:38,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:38,307 INFO L225 Difference]: With dead ends: 155 [2020-12-23 13:45:38,307 INFO L226 Difference]: Without dead ends: 52 [2020-12-23 13:45:38,308 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 [2020-12-23 13:45:38,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-12-23 13:45:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2020-12-23 13:45:38,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-12-23 13:45:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-12-23 13:45:38,310 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 18 [2020-12-23 13:45:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:38,311 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-12-23 13:45:38,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 13:45:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-12-23 13:45:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-23 13:45:38,311 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:38,311 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] [2020-12-23 13:45:38,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 13:45:38,312 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:38,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:38,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1886722460, now seen corresponding path program 1 times [2020-12-23 13:45:38,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:38,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034077654] [2020-12-23 13:45:38,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 13:45:38,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 13:45:38,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034077654] [2020-12-23 13:45:38,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 13:45:38,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 13:45:38,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304111169] [2020-12-23 13:45:38,692 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 13:45:38,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 13:45:38,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 13:45:38,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-23 13:45:38,693 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 8 states. [2020-12-23 13:45:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 13:45:38,844 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2020-12-23 13:45:38,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 13:45:38,845 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2020-12-23 13:45:38,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 13:45:38,845 INFO L225 Difference]: With dead ends: 63 [2020-12-23 13:45:38,845 INFO L226 Difference]: Without dead ends: 36 [2020-12-23 13:45:38,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-12-23 13:45:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-23 13:45:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-12-23 13:45:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-23 13:45:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2020-12-23 13:45:38,848 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 21 [2020-12-23 13:45:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 13:45:38,848 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2020-12-23 13:45:38,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 13:45:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2020-12-23 13:45:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-23 13:45:38,849 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 13:45:38,849 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] [2020-12-23 13:45:38,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 13:45:38,849 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 13:45:38,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 13:45:38,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1747085148, now seen corresponding path program 2 times [2020-12-23 13:45:38,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 13:45:38,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166838963] [2020-12-23 13:45:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 13:45:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:45:38,903 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:45:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 13:45:38,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 13:45:38,998 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 13:45:38,999 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 13:45:38,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 13:45:39,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 01:45:39 BasicIcfg [2020-12-23 13:45:39,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 13:45:39,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 13:45:39,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 13:45:39,097 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 13:45:39,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 01:45:25" (3/4) ... [2020-12-23 13:45:39,099 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 13:45:39,228 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/safe030_power.opt.i-witness.graphml [2020-12-23 13:45:39,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 13:45:39,229 INFO L168 Benchmark]: Toolchain (without parser) took 17096.57 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 130.9 MB in the beginning and 171.0 MB in the end (delta: -40.1 MB). Peak memory consumption was 123.2 MB. Max. memory is 8.0 GB. [2020-12-23 13:45:39,229 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 13:45:39,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.62 ms. Allocated memory is still 151.0 MB. Free memory was 130.6 MB in the beginning and 112.8 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. [2020-12-23 13:45:39,230 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.88 ms. Allocated memory is still 151.0 MB. Free memory was 112.8 MB in the beginning and 109.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:45:39,230 INFO L168 Benchmark]: Boogie Preprocessor took 82.37 ms. Allocated memory is still 151.0 MB. Free memory was 109.9 MB in the beginning and 107.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 13:45:39,231 INFO L168 Benchmark]: RCFGBuilder took 2273.37 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 107.8 MB in the beginning and 73.7 MB in the end (delta: 34.1 MB). Peak memory consumption was 65.8 MB. Max. memory is 8.0 GB. [2020-12-23 13:45:39,231 INFO L168 Benchmark]: TraceAbstraction took 13723.01 ms. Allocated memory was 181.4 MB in the beginning and 314.6 MB in the end (delta: 133.2 MB). Free memory was 73.7 MB in the beginning and 183.6 MB in the end (delta: -109.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 8.0 GB. [2020-12-23 13:45:39,232 INFO L168 Benchmark]: Witness Printer took 131.67 ms. Allocated memory is still 314.6 MB. Free memory was 183.6 MB in the beginning and 171.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-23 13:45:39,234 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.25 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 805.62 ms. Allocated memory is still 151.0 MB. Free memory was 130.6 MB in the beginning and 112.8 MB in the end (delta: 17.7 MB). Peak memory consumption was 17.3 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 72.88 ms. Allocated memory is still 151.0 MB. Free memory was 112.8 MB in the beginning and 109.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 82.37 ms. Allocated memory is still 151.0 MB. Free memory was 109.9 MB in the beginning and 107.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2273.37 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 107.8 MB in the beginning and 73.7 MB in the end (delta: 34.1 MB). Peak memory consumption was 65.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13723.01 ms. Allocated memory was 181.4 MB in the beginning and 314.6 MB in the end (delta: 133.2 MB). Free memory was 73.7 MB in the beginning and 183.6 MB in the end (delta: -109.9 MB). Peak memory consumption was 23.3 MB. Max. memory is 8.0 GB. * Witness Printer took 131.67 ms. Allocated memory is still 314.6 MB. Free memory was 183.6 MB in the beginning and 171.0 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1011 VarBasedMoverChecksPositive, 59 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 39 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 119 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.2s, 103 PlacesBefore, 36 PlacesAfterwards, 95 TransitionsBefore, 27 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 80 TotalNumberOfCompositions, 3915 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=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] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 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) [L789] 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) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 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 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 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 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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=2, 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, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.4s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.2s, HoareTripleCheckerStatistics: 393 SDtfs, 392 SDslu, 668 SDs, 0 SdLazy, 312 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=770occurred 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, 14 MinimizatonAttempts, 176 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 19207 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...