/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/systemc/mem_slave_tlm.4.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:22:59,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:22:59,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:22:59,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:22:59,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:22:59,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:22:59,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:22:59,537 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:22:59,539 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:22:59,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:22:59,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:22:59,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:22:59,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:22:59,544 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:22:59,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:22:59,547 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:22:59,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:22:59,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:22:59,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:22:59,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:22:59,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:22:59,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:22:59,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:22:59,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:22:59,582 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:22:59,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:22:59,583 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:22:59,584 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:22:59,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:22:59,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:22:59,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:22:59,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:22:59,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:22:59,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:22:59,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:22:59,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:22:59,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:22:59,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:22:59,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:22:59,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:22:59,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:22:59,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:22:59,619 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:22:59,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:22:59,621 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:22:59,621 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:22:59,621 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:22:59,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:22:59,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:22:59,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:22:59,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:22:59,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:22:59,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:22:59,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:22:59,623 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:22:59,623 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:22:59,623 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:22:59,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:22:59,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:22:59,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:22:59,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:22:59,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:22:59,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:22:59,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:22:59,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:22:59,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:22:59,628 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:22:59,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:23:00,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:23:00,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:23:00,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:23:00,034 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:23:00,035 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:23:00,036 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c [2021-01-06 19:23:00,113 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3f90dd5bd/29e338c5913b4f049761201cf5c2f837/FLAG482389bc7 [2021-01-06 19:23:00,739 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:23:00,740 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.4.cil.c [2021-01-06 19:23:00,760 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3f90dd5bd/29e338c5913b4f049761201cf5c2f837/FLAG482389bc7 [2021-01-06 19:23:01,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3f90dd5bd/29e338c5913b4f049761201cf5c2f837 [2021-01-06 19:23:01,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:23:01,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:23:01,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:23:01,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:23:01,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:23:01,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,076 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4926c7a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01, skipping insertion in model container [2021-01-06 19:23:01,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,085 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:23:01,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:23:01,298 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/systemc/mem_slave_tlm.4.cil.c[341,354] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~s_memory0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2021-01-06 19:23:01,509 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:23:01,523 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:23:01,536 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/systemc/mem_slave_tlm.4.cil.c[341,354] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~x~0,] left hand side expression in assignment: lhs: VariableLHS[~s_memory0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_memory3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~c_req_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_req_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_a~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_tt_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~d_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~a_t~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_a___0~0,] left hand side expression in assignment: lhs: VariableLHS[~req_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~d~0,] left hand side expression in assignment: lhs: VariableLHS[~a~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status___0~0,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d___0~0,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_a___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_type___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_status___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~rsp_t_d___0~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~req_type~1,] left hand side expression in assignment: lhs: VariableLHS[~req_a~1,] left hand side expression in assignment: lhs: VariableLHS[~req_d~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_type~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_status~1,] left hand side expression in assignment: lhs: VariableLHS[~rsp_d~1,] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_type~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_status~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_rsp_d~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~s_run_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_req~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_empty_rsp~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_req_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_read_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_write_rsp_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_lock~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~c_m_ev~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] [2021-01-06 19:23:01,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:23:01,685 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:23:01,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01 WrapperNode [2021-01-06 19:23:01,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:23:01,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:23:01,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:23:01,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:23:01,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:23:01,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:23:01,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:23:01,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:23:01,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,823 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (1/1) ... [2021-01-06 19:23:01,829 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:23:01,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:23:01,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:23:01,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:23:01,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:23:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:23:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:23:01,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:23:01,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:23:03,018 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:23:03,018 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2021-01-06 19:23:03,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:23:03 BoogieIcfgContainer [2021-01-06 19:23:03,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:23:03,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:23:03,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:23:03,026 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:23:03,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:23:01" (1/3) ... [2021-01-06 19:23:03,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b57d580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:23:03, skipping insertion in model container [2021-01-06 19:23:03,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:23:01" (2/3) ... [2021-01-06 19:23:03,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b57d580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:23:03, skipping insertion in model container [2021-01-06 19:23:03,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:23:03" (3/3) ... [2021-01-06 19:23:03,030 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.4.cil.c [2021-01-06 19:23:03,037 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:23:03,043 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2021-01-06 19:23:03,062 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-01-06 19:23:03,093 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:23:03,093 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:23:03,093 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:23:03,094 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:23:03,094 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:23:03,094 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:23:03,094 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:23:03,094 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:23:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2021-01-06 19:23:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 19:23:03,129 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:03,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:03,130 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:03,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:03,137 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2021-01-06 19:23:03,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:03,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418481475] [2021-01-06 19:23:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:03,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418481475] [2021-01-06 19:23:03,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:03,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:03,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630039303] [2021-01-06 19:23:03,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:03,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:03,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:03,391 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 3 states. [2021-01-06 19:23:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:03,944 INFO L93 Difference]: Finished difference Result 731 states and 1328 transitions. [2021-01-06 19:23:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:03,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-06 19:23:03,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:03,997 INFO L225 Difference]: With dead ends: 731 [2021-01-06 19:23:03,997 INFO L226 Difference]: Without dead ends: 452 [2021-01-06 19:23:04,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-01-06 19:23:04,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 436. [2021-01-06 19:23:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2021-01-06 19:23:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 690 transitions. [2021-01-06 19:23:04,181 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 690 transitions. Word has length 28 [2021-01-06 19:23:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:04,181 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 690 transitions. [2021-01-06 19:23:04,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 690 transitions. [2021-01-06 19:23:04,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:23:04,190 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:04,191 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:04,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:23:04,192 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:04,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:04,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1067368876, now seen corresponding path program 1 times [2021-01-06 19:23:04,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:04,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708794609] [2021-01-06 19:23:04,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:04,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:04,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708794609] [2021-01-06 19:23:04,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:04,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:04,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353528640] [2021-01-06 19:23:04,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:04,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:04,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:04,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:04,278 INFO L87 Difference]: Start difference. First operand 436 states and 690 transitions. Second operand 3 states. [2021-01-06 19:23:04,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:04,453 INFO L93 Difference]: Finished difference Result 1147 states and 1839 transitions. [2021-01-06 19:23:04,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:04,454 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 19:23:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:04,464 INFO L225 Difference]: With dead ends: 1147 [2021-01-06 19:23:04,465 INFO L226 Difference]: Without dead ends: 725 [2021-01-06 19:23:04,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2021-01-06 19:23:04,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 709. [2021-01-06 19:23:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 709 states. [2021-01-06 19:23:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1153 transitions. [2021-01-06 19:23:04,568 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1153 transitions. Word has length 39 [2021-01-06 19:23:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:04,569 INFO L481 AbstractCegarLoop]: Abstraction has 709 states and 1153 transitions. [2021-01-06 19:23:04,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1153 transitions. [2021-01-06 19:23:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-01-06 19:23:04,575 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:04,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:04,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:23:04,577 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:04,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:04,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1759790175, now seen corresponding path program 1 times [2021-01-06 19:23:04,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:04,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711508675] [2021-01-06 19:23:04,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:04,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711508675] [2021-01-06 19:23:04,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:04,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:04,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478147546] [2021-01-06 19:23:04,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:04,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:04,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:04,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:04,722 INFO L87 Difference]: Start difference. First operand 709 states and 1153 transitions. Second operand 3 states. [2021-01-06 19:23:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:04,794 INFO L93 Difference]: Finished difference Result 1779 states and 2892 transitions. [2021-01-06 19:23:04,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:04,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2021-01-06 19:23:04,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:04,803 INFO L225 Difference]: With dead ends: 1779 [2021-01-06 19:23:04,803 INFO L226 Difference]: Without dead ends: 1095 [2021-01-06 19:23:04,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:04,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2021-01-06 19:23:04,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1083. [2021-01-06 19:23:04,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1083 states. [2021-01-06 19:23:04,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1756 transitions. [2021-01-06 19:23:04,867 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1756 transitions. Word has length 40 [2021-01-06 19:23:04,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:04,874 INFO L481 AbstractCegarLoop]: Abstraction has 1083 states and 1756 transitions. [2021-01-06 19:23:04,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:04,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1756 transitions. [2021-01-06 19:23:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-01-06 19:23:04,880 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:04,880 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:04,880 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:23:04,881 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash -361630758, now seen corresponding path program 1 times [2021-01-06 19:23:04,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:04,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853363735] [2021-01-06 19:23:04,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:04,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853363735] [2021-01-06 19:23:04,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:04,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:23:04,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461943197] [2021-01-06 19:23:04,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:23:04,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:04,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:23:04,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:23:04,977 INFO L87 Difference]: Start difference. First operand 1083 states and 1756 transitions. Second operand 4 states. [2021-01-06 19:23:05,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:05,399 INFO L93 Difference]: Finished difference Result 2981 states and 4817 transitions. [2021-01-06 19:23:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:23:05,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2021-01-06 19:23:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:05,411 INFO L225 Difference]: With dead ends: 2981 [2021-01-06 19:23:05,411 INFO L226 Difference]: Without dead ends: 1923 [2021-01-06 19:23:05,416 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:23:05,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2021-01-06 19:23:05,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1693. [2021-01-06 19:23:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1693 states. [2021-01-06 19:23:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2712 transitions. [2021-01-06 19:23:05,501 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2712 transitions. Word has length 46 [2021-01-06 19:23:05,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:05,502 INFO L481 AbstractCegarLoop]: Abstraction has 1693 states and 2712 transitions. [2021-01-06 19:23:05,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:23:05,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2712 transitions. [2021-01-06 19:23:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 19:23:05,504 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:05,504 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:05,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:23:05,504 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2021-01-06 19:23:05,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:05,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265989220] [2021-01-06 19:23:05,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:05,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265989220] [2021-01-06 19:23:05,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:05,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:23:05,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408669175] [2021-01-06 19:23:05,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:23:05,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:05,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:23:05,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:23:05,613 INFO L87 Difference]: Start difference. First operand 1693 states and 2712 transitions. Second operand 4 states. [2021-01-06 19:23:06,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:06,214 INFO L93 Difference]: Finished difference Result 5041 states and 7972 transitions. [2021-01-06 19:23:06,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:23:06,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2021-01-06 19:23:06,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:06,235 INFO L225 Difference]: With dead ends: 5041 [2021-01-06 19:23:06,235 INFO L226 Difference]: Without dead ends: 3367 [2021-01-06 19:23:06,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:23:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2021-01-06 19:23:06,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 2985. [2021-01-06 19:23:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2985 states. [2021-01-06 19:23:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4711 transitions. [2021-01-06 19:23:06,386 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4711 transitions. Word has length 52 [2021-01-06 19:23:06,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:06,386 INFO L481 AbstractCegarLoop]: Abstraction has 2985 states and 4711 transitions. [2021-01-06 19:23:06,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:23:06,386 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4711 transitions. [2021-01-06 19:23:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 19:23:06,389 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:06,390 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:06,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:23:06,391 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2021-01-06 19:23:06,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:06,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863812985] [2021-01-06 19:23:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:06,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863812985] [2021-01-06 19:23:06,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:06,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:06,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709226169] [2021-01-06 19:23:06,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:06,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:06,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:06,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:06,505 INFO L87 Difference]: Start difference. First operand 2985 states and 4711 transitions. Second operand 3 states. [2021-01-06 19:23:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:06,728 INFO L93 Difference]: Finished difference Result 7023 states and 11042 transitions. [2021-01-06 19:23:06,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:06,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2021-01-06 19:23:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:06,752 INFO L225 Difference]: With dead ends: 7023 [2021-01-06 19:23:06,753 INFO L226 Difference]: Without dead ends: 4061 [2021-01-06 19:23:06,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:06,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2021-01-06 19:23:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 3877. [2021-01-06 19:23:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3877 states. [2021-01-06 19:23:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3877 states to 3877 states and 6045 transitions. [2021-01-06 19:23:06,986 INFO L78 Accepts]: Start accepts. Automaton has 3877 states and 6045 transitions. Word has length 52 [2021-01-06 19:23:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:06,987 INFO L481 AbstractCegarLoop]: Abstraction has 3877 states and 6045 transitions. [2021-01-06 19:23:06,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:06,987 INFO L276 IsEmpty]: Start isEmpty. Operand 3877 states and 6045 transitions. [2021-01-06 19:23:06,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-01-06 19:23:06,989 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:06,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:06,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:23:06,990 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:06,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:06,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1227642575, now seen corresponding path program 1 times [2021-01-06 19:23:06,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:06,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499385045] [2021-01-06 19:23:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:07,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:07,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499385045] [2021-01-06 19:23:07,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:07,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:07,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846607532] [2021-01-06 19:23:07,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:07,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:07,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:07,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:07,036 INFO L87 Difference]: Start difference. First operand 3877 states and 6045 transitions. Second operand 3 states. [2021-01-06 19:23:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:07,643 INFO L93 Difference]: Finished difference Result 9323 states and 14657 transitions. [2021-01-06 19:23:07,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:07,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2021-01-06 19:23:07,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:07,676 INFO L225 Difference]: With dead ends: 9323 [2021-01-06 19:23:07,676 INFO L226 Difference]: Without dead ends: 5469 [2021-01-06 19:23:07,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2021-01-06 19:23:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 4695. [2021-01-06 19:23:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4695 states. [2021-01-06 19:23:08,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 7058 transitions. [2021-01-06 19:23:08,009 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 7058 transitions. Word has length 59 [2021-01-06 19:23:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:08,010 INFO L481 AbstractCegarLoop]: Abstraction has 4695 states and 7058 transitions. [2021-01-06 19:23:08,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 7058 transitions. [2021-01-06 19:23:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:23:08,013 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:08,013 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:08,013 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:23:08,013 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:08,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash -758236603, now seen corresponding path program 1 times [2021-01-06 19:23:08,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:08,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711437392] [2021-01-06 19:23:08,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:08,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711437392] [2021-01-06 19:23:08,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:08,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:08,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981120448] [2021-01-06 19:23:08,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:08,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:08,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:08,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:08,063 INFO L87 Difference]: Start difference. First operand 4695 states and 7058 transitions. Second operand 3 states. [2021-01-06 19:23:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:08,327 INFO L93 Difference]: Finished difference Result 9233 states and 13893 transitions. [2021-01-06 19:23:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:08,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 19:23:08,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:08,353 INFO L225 Difference]: With dead ends: 9233 [2021-01-06 19:23:08,353 INFO L226 Difference]: Without dead ends: 4561 [2021-01-06 19:23:08,362 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4561 states. [2021-01-06 19:23:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4561 to 4561. [2021-01-06 19:23:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4561 states. [2021-01-06 19:23:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 6757 transitions. [2021-01-06 19:23:08,676 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 6757 transitions. Word has length 61 [2021-01-06 19:23:08,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:08,677 INFO L481 AbstractCegarLoop]: Abstraction has 4561 states and 6757 transitions. [2021-01-06 19:23:08,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 6757 transitions. [2021-01-06 19:23:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-01-06 19:23:08,680 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:08,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:08,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:23:08,680 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:08,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:08,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1625860633, now seen corresponding path program 1 times [2021-01-06 19:23:08,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:08,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482093944] [2021-01-06 19:23:08,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:08,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:08,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482093944] [2021-01-06 19:23:08,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:08,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:08,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145424024] [2021-01-06 19:23:08,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:08,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:08,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:08,725 INFO L87 Difference]: Start difference. First operand 4561 states and 6757 transitions. Second operand 3 states. [2021-01-06 19:23:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:08,966 INFO L93 Difference]: Finished difference Result 9769 states and 14632 transitions. [2021-01-06 19:23:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:08,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2021-01-06 19:23:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:08,995 INFO L225 Difference]: With dead ends: 9769 [2021-01-06 19:23:08,995 INFO L226 Difference]: Without dead ends: 5231 [2021-01-06 19:23:09,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5231 states. [2021-01-06 19:23:09,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5231 to 3507. [2021-01-06 19:23:09,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3507 states. [2021-01-06 19:23:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 5247 transitions. [2021-01-06 19:23:09,242 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 5247 transitions. Word has length 62 [2021-01-06 19:23:09,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:09,244 INFO L481 AbstractCegarLoop]: Abstraction has 3507 states and 5247 transitions. [2021-01-06 19:23:09,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:09,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 5247 transitions. [2021-01-06 19:23:09,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 19:23:09,246 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:09,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:09,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:23:09,246 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:09,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:09,247 INFO L82 PathProgramCache]: Analyzing trace with hash 66248594, now seen corresponding path program 1 times [2021-01-06 19:23:09,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:09,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277534050] [2021-01-06 19:23:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:09,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277534050] [2021-01-06 19:23:09,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:09,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:23:09,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837716593] [2021-01-06 19:23:09,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:23:09,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:23:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:09,337 INFO L87 Difference]: Start difference. First operand 3507 states and 5247 transitions. Second operand 6 states. [2021-01-06 19:23:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:10,743 INFO L93 Difference]: Finished difference Result 16565 states and 24575 transitions. [2021-01-06 19:23:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 19:23:10,744 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2021-01-06 19:23:10,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:10,775 INFO L225 Difference]: With dead ends: 16565 [2021-01-06 19:23:10,775 INFO L226 Difference]: Without dead ends: 13277 [2021-01-06 19:23:10,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2021-01-06 19:23:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2021-01-06 19:23:11,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 4373. [2021-01-06 19:23:11,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4373 states. [2021-01-06 19:23:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 6505 transitions. [2021-01-06 19:23:11,106 INFO L78 Accepts]: Start accepts. Automaton has 4373 states and 6505 transitions. Word has length 64 [2021-01-06 19:23:11,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:11,106 INFO L481 AbstractCegarLoop]: Abstraction has 4373 states and 6505 transitions. [2021-01-06 19:23:11,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:23:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 4373 states and 6505 transitions. [2021-01-06 19:23:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-01-06 19:23:11,109 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:11,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:11,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:23:11,109 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:11,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:11,110 INFO L82 PathProgramCache]: Analyzing trace with hash -557616202, now seen corresponding path program 1 times [2021-01-06 19:23:11,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:11,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693730923] [2021-01-06 19:23:11,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:11,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693730923] [2021-01-06 19:23:11,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:11,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:23:11,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511403354] [2021-01-06 19:23:11,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:23:11,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:11,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:23:11,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:23:11,177 INFO L87 Difference]: Start difference. First operand 4373 states and 6505 transitions. Second operand 7 states. [2021-01-06 19:23:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:13,346 INFO L93 Difference]: Finished difference Result 30063 states and 44410 transitions. [2021-01-06 19:23:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-01-06 19:23:13,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2021-01-06 19:23:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:13,413 INFO L225 Difference]: With dead ends: 30063 [2021-01-06 19:23:13,414 INFO L226 Difference]: Without dead ends: 25909 [2021-01-06 19:23:13,428 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2021-01-06 19:23:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25909 states. [2021-01-06 19:23:13,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25909 to 4681. [2021-01-06 19:23:13,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2021-01-06 19:23:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 6915 transitions. [2021-01-06 19:23:13,985 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 6915 transitions. Word has length 65 [2021-01-06 19:23:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:13,985 INFO L481 AbstractCegarLoop]: Abstraction has 4681 states and 6915 transitions. [2021-01-06 19:23:13,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:23:13,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 6915 transitions. [2021-01-06 19:23:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-01-06 19:23:13,994 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:13,994 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:13,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:23:13,995 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:13,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:13,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1917613388, now seen corresponding path program 1 times [2021-01-06 19:23:13,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:13,996 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127018774] [2021-01-06 19:23:13,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:14,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127018774] [2021-01-06 19:23:14,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:14,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:14,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149629767] [2021-01-06 19:23:14,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:14,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:14,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:14,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:14,042 INFO L87 Difference]: Start difference. First operand 4681 states and 6915 transitions. Second operand 3 states. [2021-01-06 19:23:14,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:14,478 INFO L93 Difference]: Finished difference Result 9872 states and 14556 transitions. [2021-01-06 19:23:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:14,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2021-01-06 19:23:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:14,493 INFO L225 Difference]: With dead ends: 9872 [2021-01-06 19:23:14,494 INFO L226 Difference]: Without dead ends: 5212 [2021-01-06 19:23:14,501 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5212 states. [2021-01-06 19:23:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5212 to 5138. [2021-01-06 19:23:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5138 states. [2021-01-06 19:23:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5138 states to 5138 states and 7568 transitions. [2021-01-06 19:23:14,851 INFO L78 Accepts]: Start accepts. Automaton has 5138 states and 7568 transitions. Word has length 77 [2021-01-06 19:23:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:14,851 INFO L481 AbstractCegarLoop]: Abstraction has 5138 states and 7568 transitions. [2021-01-06 19:23:14,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5138 states and 7568 transitions. [2021-01-06 19:23:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 19:23:14,855 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:14,855 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:14,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:23:14,855 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:14,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:14,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1623922119, now seen corresponding path program 1 times [2021-01-06 19:23:14,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:14,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882174319] [2021-01-06 19:23:14,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:14,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882174319] [2021-01-06 19:23:14,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:14,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:23:14,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360038346] [2021-01-06 19:23:14,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:23:14,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:14,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:23:14,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:23:14,913 INFO L87 Difference]: Start difference. First operand 5138 states and 7568 transitions. Second operand 4 states. [2021-01-06 19:23:15,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:15,751 INFO L93 Difference]: Finished difference Result 13746 states and 20084 transitions. [2021-01-06 19:23:15,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:23:15,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2021-01-06 19:23:15,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:15,772 INFO L225 Difference]: With dead ends: 13746 [2021-01-06 19:23:15,773 INFO L226 Difference]: Without dead ends: 8508 [2021-01-06 19:23:15,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:23:15,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8508 states. [2021-01-06 19:23:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8508 to 7573. [2021-01-06 19:23:16,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7573 states. [2021-01-06 19:23:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7573 states to 7573 states and 10928 transitions. [2021-01-06 19:23:16,349 INFO L78 Accepts]: Start accepts. Automaton has 7573 states and 10928 transitions. Word has length 88 [2021-01-06 19:23:16,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:16,349 INFO L481 AbstractCegarLoop]: Abstraction has 7573 states and 10928 transitions. [2021-01-06 19:23:16,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:23:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7573 states and 10928 transitions. [2021-01-06 19:23:16,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:23:16,353 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:16,353 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:16,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:23:16,354 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:16,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:16,354 INFO L82 PathProgramCache]: Analyzing trace with hash 510402257, now seen corresponding path program 1 times [2021-01-06 19:23:16,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:16,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511865989] [2021-01-06 19:23:16,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:16,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511865989] [2021-01-06 19:23:16,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:16,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:16,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864914738] [2021-01-06 19:23:16,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:16,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:16,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:16,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:16,398 INFO L87 Difference]: Start difference. First operand 7573 states and 10928 transitions. Second operand 3 states. [2021-01-06 19:23:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:16,641 INFO L93 Difference]: Finished difference Result 10916 states and 15781 transitions. [2021-01-06 19:23:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:16,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2021-01-06 19:23:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:16,649 INFO L225 Difference]: With dead ends: 10916 [2021-01-06 19:23:16,649 INFO L226 Difference]: Without dead ends: 3351 [2021-01-06 19:23:16,659 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3351 states. [2021-01-06 19:23:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3351 to 3298. [2021-01-06 19:23:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3298 states. [2021-01-06 19:23:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 4457 transitions. [2021-01-06 19:23:16,971 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 4457 transitions. Word has length 95 [2021-01-06 19:23:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:16,971 INFO L481 AbstractCegarLoop]: Abstraction has 3298 states and 4457 transitions. [2021-01-06 19:23:16,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 4457 transitions. [2021-01-06 19:23:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-01-06 19:23:16,973 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:16,974 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:16,974 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:23:16,974 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:16,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1852409954, now seen corresponding path program 1 times [2021-01-06 19:23:16,975 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:16,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832381562] [2021-01-06 19:23:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:17,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832381562] [2021-01-06 19:23:17,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:17,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:23:17,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373378558] [2021-01-06 19:23:17,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:23:17,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:17,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:23:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:23:17,047 INFO L87 Difference]: Start difference. First operand 3298 states and 4457 transitions. Second operand 5 states. [2021-01-06 19:23:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:18,160 INFO L93 Difference]: Finished difference Result 12573 states and 16987 transitions. [2021-01-06 19:23:18,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 19:23:18,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2021-01-06 19:23:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:18,183 INFO L225 Difference]: With dead ends: 12573 [2021-01-06 19:23:18,184 INFO L226 Difference]: Without dead ends: 9449 [2021-01-06 19:23:18,192 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:23:18,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9449 states. [2021-01-06 19:23:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9449 to 3300. [2021-01-06 19:23:18,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3300 states. [2021-01-06 19:23:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4453 transitions. [2021-01-06 19:23:18,630 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4453 transitions. Word has length 98 [2021-01-06 19:23:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:18,631 INFO L481 AbstractCegarLoop]: Abstraction has 3300 states and 4453 transitions. [2021-01-06 19:23:18,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:23:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4453 transitions. [2021-01-06 19:23:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:23:18,633 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:18,633 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:18,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:23:18,633 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:18,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:18,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1180801181, now seen corresponding path program 1 times [2021-01-06 19:23:18,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:18,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137679481] [2021-01-06 19:23:18,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:18,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137679481] [2021-01-06 19:23:18,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319495502] [2021-01-06 19:23:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:18,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:23:18,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:19,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:23:19,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-06 19:23:19,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492157556] [2021-01-06 19:23:19,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:19,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:19,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:19,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:19,066 INFO L87 Difference]: Start difference. First operand 3300 states and 4453 transitions. Second operand 3 states. [2021-01-06 19:23:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:19,362 INFO L93 Difference]: Finished difference Result 3939 states and 5308 transitions. [2021-01-06 19:23:19,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:19,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:23:19,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:19,369 INFO L225 Difference]: With dead ends: 3939 [2021-01-06 19:23:19,369 INFO L226 Difference]: Without dead ends: 3935 [2021-01-06 19:23:19,371 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:19,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3935 states. [2021-01-06 19:23:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3935 to 3885. [2021-01-06 19:23:19,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2021-01-06 19:23:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 5232 transitions. [2021-01-06 19:23:19,688 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 5232 transitions. Word has length 100 [2021-01-06 19:23:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:19,689 INFO L481 AbstractCegarLoop]: Abstraction has 3885 states and 5232 transitions. [2021-01-06 19:23:19,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5232 transitions. [2021-01-06 19:23:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 19:23:19,692 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:19,693 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:19,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-01-06 19:23:19,904 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:19,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash -411629455, now seen corresponding path program 1 times [2021-01-06 19:23:19,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:19,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012903160] [2021-01-06 19:23:19,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:23:20,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012903160] [2021-01-06 19:23:20,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650017230] [2021-01-06 19:23:20,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:20,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:23:20,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:20,371 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:20,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:23:20,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-06 19:23:20,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634969286] [2021-01-06 19:23:20,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:20,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:20,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:20,378 INFO L87 Difference]: Start difference. First operand 3885 states and 5232 transitions. Second operand 3 states. [2021-01-06 19:23:20,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:20,699 INFO L93 Difference]: Finished difference Result 6919 states and 9369 transitions. [2021-01-06 19:23:20,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:20,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2021-01-06 19:23:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:20,705 INFO L225 Difference]: With dead ends: 6919 [2021-01-06 19:23:20,705 INFO L226 Difference]: Without dead ends: 3043 [2021-01-06 19:23:20,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2021-01-06 19:23:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2822. [2021-01-06 19:23:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2021-01-06 19:23:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 3744 transitions. [2021-01-06 19:23:20,993 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 3744 transitions. Word has length 155 [2021-01-06 19:23:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:20,994 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 3744 transitions. [2021-01-06 19:23:20,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3744 transitions. [2021-01-06 19:23:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-01-06 19:23:20,997 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:20,997 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:21,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 19:23:21,213 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1795907654, now seen corresponding path program 1 times [2021-01-06 19:23:21,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:21,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156077976] [2021-01-06 19:23:21,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:21,299 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:21,299 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156077976] [2021-01-06 19:23:21,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931260697] [2021-01-06 19:23:21,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:21,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:23:21,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:23:21,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:23:21,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-06 19:23:21,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964548644] [2021-01-06 19:23:21,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:21,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:21,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:21,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:21,608 INFO L87 Difference]: Start difference. First operand 2822 states and 3744 transitions. Second operand 3 states. [2021-01-06 19:23:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:21,913 INFO L93 Difference]: Finished difference Result 5475 states and 7304 transitions. [2021-01-06 19:23:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:21,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2021-01-06 19:23:21,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:21,917 INFO L225 Difference]: With dead ends: 5475 [2021-01-06 19:23:21,918 INFO L226 Difference]: Without dead ends: 2822 [2021-01-06 19:23:21,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:21,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2021-01-06 19:23:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2822. [2021-01-06 19:23:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2822 states. [2021-01-06 19:23:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 3648 transitions. [2021-01-06 19:23:22,152 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 3648 transitions. Word has length 158 [2021-01-06 19:23:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:22,152 INFO L481 AbstractCegarLoop]: Abstraction has 2822 states and 3648 transitions. [2021-01-06 19:23:22,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 3648 transitions. [2021-01-06 19:23:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 19:23:22,156 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:22,156 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:22,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 19:23:22,372 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1353529397, now seen corresponding path program 1 times [2021-01-06 19:23:22,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:22,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830449266] [2021-01-06 19:23:22,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:22,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830449266] [2021-01-06 19:23:22,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583368824] [2021-01-06 19:23:22,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:22,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 19:23:22,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:22,728 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 19:23:22,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:23:22,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-01-06 19:23:22,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641740141] [2021-01-06 19:23:22,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:22,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:22,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:22,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:22,731 INFO L87 Difference]: Start difference. First operand 2822 states and 3648 transitions. Second operand 3 states. [2021-01-06 19:23:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:23,336 INFO L93 Difference]: Finished difference Result 6382 states and 8413 transitions. [2021-01-06 19:23:23,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:23,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2021-01-06 19:23:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:23,341 INFO L225 Difference]: With dead ends: 6382 [2021-01-06 19:23:23,341 INFO L226 Difference]: Without dead ends: 3729 [2021-01-06 19:23:23,344 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:23:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2021-01-06 19:23:23,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3638. [2021-01-06 19:23:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3638 states. [2021-01-06 19:23:23,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3638 states to 3638 states and 4593 transitions. [2021-01-06 19:23:23,591 INFO L78 Accepts]: Start accepts. Automaton has 3638 states and 4593 transitions. Word has length 159 [2021-01-06 19:23:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:23,592 INFO L481 AbstractCegarLoop]: Abstraction has 3638 states and 4593 transitions. [2021-01-06 19:23:23,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 3638 states and 4593 transitions. [2021-01-06 19:23:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2021-01-06 19:23:23,594 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:23,594 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:23,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:23,808 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:23,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1696904249, now seen corresponding path program 1 times [2021-01-06 19:23:23,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:23,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768629996] [2021-01-06 19:23:23,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:24,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768629996] [2021-01-06 19:23:24,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613512513] [2021-01-06 19:23:24,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:24,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 19:23:24,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-01-06 19:23:24,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:24,445 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-01-06 19:23:24,445 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376729934] [2021-01-06 19:23:24,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:23:24,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:24,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:23:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:23:24,447 INFO L87 Difference]: Start difference. First operand 3638 states and 4593 transitions. Second operand 9 states. [2021-01-06 19:23:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:26,839 INFO L93 Difference]: Finished difference Result 18266 states and 23153 transitions. [2021-01-06 19:23:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-01-06 19:23:26,840 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2021-01-06 19:23:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:26,868 INFO L225 Difference]: With dead ends: 18266 [2021-01-06 19:23:26,868 INFO L226 Difference]: Without dead ends: 14797 [2021-01-06 19:23:26,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2021-01-06 19:23:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14797 states. [2021-01-06 19:23:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14797 to 5157. [2021-01-06 19:23:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5157 states. [2021-01-06 19:23:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5157 states to 5157 states and 6540 transitions. [2021-01-06 19:23:27,512 INFO L78 Accepts]: Start accepts. Automaton has 5157 states and 6540 transitions. Word has length 161 [2021-01-06 19:23:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:27,512 INFO L481 AbstractCegarLoop]: Abstraction has 5157 states and 6540 transitions. [2021-01-06 19:23:27,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:23:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 5157 states and 6540 transitions. [2021-01-06 19:23:27,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2021-01-06 19:23:27,518 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:27,519 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:27,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:27,733 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:27,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1534496844, now seen corresponding path program 1 times [2021-01-06 19:23:27,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:27,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438689790] [2021-01-06 19:23:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:23:28,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438689790] [2021-01-06 19:23:28,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38280839] [2021-01-06 19:23:28,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:28,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-06 19:23:28,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:28,547 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:23:28,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:28,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-01-06 19:23:28,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449821616] [2021-01-06 19:23:28,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:23:28,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:28,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:23:28,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:23:28,549 INFO L87 Difference]: Start difference. First operand 5157 states and 6540 transitions. Second operand 11 states. [2021-01-06 19:23:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:31,425 INFO L93 Difference]: Finished difference Result 23793 states and 30067 transitions. [2021-01-06 19:23:31,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-01-06 19:23:31,426 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 259 [2021-01-06 19:23:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:31,455 INFO L225 Difference]: With dead ends: 23793 [2021-01-06 19:23:31,455 INFO L226 Difference]: Without dead ends: 18805 [2021-01-06 19:23:31,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 277 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=1631, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 19:23:31,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18805 states. [2021-01-06 19:23:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18805 to 6553. [2021-01-06 19:23:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6553 states. [2021-01-06 19:23:32,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 8320 transitions. [2021-01-06 19:23:32,248 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 8320 transitions. Word has length 259 [2021-01-06 19:23:32,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:32,249 INFO L481 AbstractCegarLoop]: Abstraction has 6553 states and 8320 transitions. [2021-01-06 19:23:32,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:23:32,249 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 8320 transitions. [2021-01-06 19:23:32,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2021-01-06 19:23:32,256 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:32,256 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:32,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:32,471 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:32,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2121178541, now seen corresponding path program 1 times [2021-01-06 19:23:32,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:32,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891795908] [2021-01-06 19:23:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 15 proven. 448 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 19:23:32,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891795908] [2021-01-06 19:23:32,942 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993891772] [2021-01-06 19:23:32,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:33,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-06 19:23:33,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:33,746 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 15 proven. 448 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 19:23:33,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:33,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-01-06 19:23:33,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541900922] [2021-01-06 19:23:33,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:23:33,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:33,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:23:33,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:23:33,748 INFO L87 Difference]: Start difference. First operand 6553 states and 8320 transitions. Second operand 13 states. [2021-01-06 19:23:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:38,036 INFO L93 Difference]: Finished difference Result 29399 states and 37094 transitions. [2021-01-06 19:23:38,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-01-06 19:23:38,036 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 358 [2021-01-06 19:23:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:38,070 INFO L225 Difference]: With dead ends: 29399 [2021-01-06 19:23:38,070 INFO L226 Difference]: Without dead ends: 23015 [2021-01-06 19:23:38,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=2655, Unknown=0, NotChecked=0, Total=2970 [2021-01-06 19:23:38,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23015 states. [2021-01-06 19:23:39,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23015 to 7951. [2021-01-06 19:23:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7951 states. [2021-01-06 19:23:39,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7951 states to 7951 states and 10102 transitions. [2021-01-06 19:23:39,165 INFO L78 Accepts]: Start accepts. Automaton has 7951 states and 10102 transitions. Word has length 358 [2021-01-06 19:23:39,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:39,166 INFO L481 AbstractCegarLoop]: Abstraction has 7951 states and 10102 transitions. [2021-01-06 19:23:39,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:23:39,166 INFO L276 IsEmpty]: Start isEmpty. Operand 7951 states and 10102 transitions. [2021-01-06 19:23:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2021-01-06 19:23:39,169 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:39,170 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:39,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:39,376 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:39,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1147875523, now seen corresponding path program 1 times [2021-01-06 19:23:39,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:39,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127108146] [2021-01-06 19:23:39,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 533 proven. 299 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 19:23:39,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127108146] [2021-01-06 19:23:39,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905509456] [2021-01-06 19:23:39,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:40,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 1331 conjuncts, 14 conjunts are in the unsatisfiable core [2021-01-06 19:23:40,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-01-06 19:23:40,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 19:23:40,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 13 [2021-01-06 19:23:40,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280679629] [2021-01-06 19:23:40,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:23:40,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:40,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:23:40,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:23:40,759 INFO L87 Difference]: Start difference. First operand 7951 states and 10102 transitions. Second operand 11 states. [2021-01-06 19:23:42,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:42,395 INFO L93 Difference]: Finished difference Result 18380 states and 23261 transitions. [2021-01-06 19:23:42,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-06 19:23:42,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 458 [2021-01-06 19:23:42,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:42,410 INFO L225 Difference]: With dead ends: 18380 [2021-01-06 19:23:42,411 INFO L226 Difference]: Without dead ends: 10595 [2021-01-06 19:23:42,418 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2021-01-06 19:23:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10595 states. [2021-01-06 19:23:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10595 to 7821. [2021-01-06 19:23:43,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7821 states. [2021-01-06 19:23:43,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7821 states to 7821 states and 9927 transitions. [2021-01-06 19:23:43,253 INFO L78 Accepts]: Start accepts. Automaton has 7821 states and 9927 transitions. Word has length 458 [2021-01-06 19:23:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:43,254 INFO L481 AbstractCegarLoop]: Abstraction has 7821 states and 9927 transitions. [2021-01-06 19:23:43,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:23:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 7821 states and 9927 transitions. [2021-01-06 19:23:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2021-01-06 19:23:43,257 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:43,257 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:43,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-06 19:23:43,459 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:43,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1350675601, now seen corresponding path program 1 times [2021-01-06 19:23:43,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:43,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357925222] [2021-01-06 19:23:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:43,695 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2021-01-06 19:23:43,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357925222] [2021-01-06 19:23:43,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:43,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:23:43,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030689418] [2021-01-06 19:23:43,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:23:43,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:43,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:23:43,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:43,698 INFO L87 Difference]: Start difference. First operand 7821 states and 9927 transitions. Second operand 3 states. [2021-01-06 19:23:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:44,021 INFO L93 Difference]: Finished difference Result 9446 states and 11784 transitions. [2021-01-06 19:23:44,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:23:44,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 459 [2021-01-06 19:23:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:44,023 INFO L225 Difference]: With dead ends: 9446 [2021-01-06 19:23:44,023 INFO L226 Difference]: Without dead ends: 1680 [2021-01-06 19:23:44,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:23:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2021-01-06 19:23:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1677. [2021-01-06 19:23:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2021-01-06 19:23:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 1844 transitions. [2021-01-06 19:23:44,254 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 1844 transitions. Word has length 459 [2021-01-06 19:23:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:44,255 INFO L481 AbstractCegarLoop]: Abstraction has 1677 states and 1844 transitions. [2021-01-06 19:23:44,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:23:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 1844 transitions. [2021-01-06 19:23:44,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-01-06 19:23:44,257 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:44,257 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:44,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:23:44,258 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:44,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:44,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2094133201, now seen corresponding path program 1 times [2021-01-06 19:23:44,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:44,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270785427] [2021-01-06 19:23:44,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:44,523 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2021-01-06 19:23:44,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270785427] [2021-01-06 19:23:44,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:44,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-06 19:23:44,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713876335] [2021-01-06 19:23:44,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 19:23:44,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:44,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 19:23:44,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:23:44,526 INFO L87 Difference]: Start difference. First operand 1677 states and 1844 transitions. Second operand 7 states. [2021-01-06 19:23:45,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:45,072 INFO L93 Difference]: Finished difference Result 3436 states and 3801 transitions. [2021-01-06 19:23:45,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-06 19:23:45,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 460 [2021-01-06 19:23:45,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:45,075 INFO L225 Difference]: With dead ends: 3436 [2021-01-06 19:23:45,075 INFO L226 Difference]: Without dead ends: 2729 [2021-01-06 19:23:45,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2021-01-06 19:23:45,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2021-01-06 19:23:45,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 1671. [2021-01-06 19:23:45,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2021-01-06 19:23:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1830 transitions. [2021-01-06 19:23:45,297 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1830 transitions. Word has length 460 [2021-01-06 19:23:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:45,297 INFO L481 AbstractCegarLoop]: Abstraction has 1671 states and 1830 transitions. [2021-01-06 19:23:45,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 19:23:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1830 transitions. [2021-01-06 19:23:45,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2021-01-06 19:23:45,300 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:45,300 INFO L422 BasicCegarLoop]: trace histogram [9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:45,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:23:45,300 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:45,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:45,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1190024889, now seen corresponding path program 1 times [2021-01-06 19:23:45,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:45,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611763580] [2021-01-06 19:23:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2021-01-06 19:23:45,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611763580] [2021-01-06 19:23:45,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:23:45,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:23:45,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599653258] [2021-01-06 19:23:45,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:23:45,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:23:45,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:23:45,552 INFO L87 Difference]: Start difference. First operand 1671 states and 1830 transitions. Second operand 5 states. [2021-01-06 19:23:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:45,877 INFO L93 Difference]: Finished difference Result 2818 states and 3106 transitions. [2021-01-06 19:23:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 19:23:45,878 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 461 [2021-01-06 19:23:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:45,880 INFO L225 Difference]: With dead ends: 2818 [2021-01-06 19:23:45,880 INFO L226 Difference]: Without dead ends: 2109 [2021-01-06 19:23:45,881 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-06 19:23:45,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2109 states. [2021-01-06 19:23:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2109 to 1621. [2021-01-06 19:23:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2021-01-06 19:23:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1733 transitions. [2021-01-06 19:23:46,047 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1733 transitions. Word has length 461 [2021-01-06 19:23:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:46,048 INFO L481 AbstractCegarLoop]: Abstraction has 1621 states and 1733 transitions. [2021-01-06 19:23:46,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:23:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1733 transitions. [2021-01-06 19:23:46,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2021-01-06 19:23:46,051 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:46,052 INFO L422 BasicCegarLoop]: trace histogram [10, 8, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:46,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:23:46,052 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:46,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1565931232, now seen corresponding path program 1 times [2021-01-06 19:23:46,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:46,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927157375] [2021-01-06 19:23:46,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 91 proven. 308 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2021-01-06 19:23:47,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927157375] [2021-01-06 19:23:47,011 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522832868] [2021-01-06 19:23:47,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:47,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 1467 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-06 19:23:47,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 93 proven. 255 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2021-01-06 19:23:48,222 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:48,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 23 [2021-01-06 19:23:48,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57985680] [2021-01-06 19:23:48,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-06 19:23:48,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:48,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-06 19:23:48,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2021-01-06 19:23:48,224 INFO L87 Difference]: Start difference. First operand 1621 states and 1733 transitions. Second operand 23 states. [2021-01-06 19:23:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:49,435 INFO L93 Difference]: Finished difference Result 1935 states and 2071 transitions. [2021-01-06 19:23:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-06 19:23:49,435 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 517 [2021-01-06 19:23:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:49,438 INFO L225 Difference]: With dead ends: 1935 [2021-01-06 19:23:49,438 INFO L226 Difference]: Without dead ends: 1933 [2021-01-06 19:23:49,440 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 521 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2021-01-06 19:23:49,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1933 states. [2021-01-06 19:23:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1933 to 1621. [2021-01-06 19:23:49,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2021-01-06 19:23:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1732 transitions. [2021-01-06 19:23:49,650 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1732 transitions. Word has length 517 [2021-01-06 19:23:49,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:49,651 INFO L481 AbstractCegarLoop]: Abstraction has 1621 states and 1732 transitions. [2021-01-06 19:23:49,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-06 19:23:49,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1732 transitions. [2021-01-06 19:23:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2021-01-06 19:23:49,654 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:49,654 INFO L422 BasicCegarLoop]: trace histogram [11, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:49,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-06 19:23:49,858 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:49,859 INFO L82 PathProgramCache]: Analyzing trace with hash 870653210, now seen corresponding path program 1 times [2021-01-06 19:23:49,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:49,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041682541] [2021-01-06 19:23:49,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 269 proven. 47 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2021-01-06 19:23:50,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041682541] [2021-01-06 19:23:50,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724758995] [2021-01-06 19:23:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:50,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 1594 conjuncts, 19 conjunts are in the unsatisfiable core [2021-01-06 19:23:50,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 981 backedges. 269 proven. 47 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2021-01-06 19:23:51,335 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:51,335 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-01-06 19:23:51,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068617856] [2021-01-06 19:23:51,337 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 19:23:51,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:51,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 19:23:51,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-01-06 19:23:51,338 INFO L87 Difference]: Start difference. First operand 1621 states and 1732 transitions. Second operand 9 states. [2021-01-06 19:23:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:51,976 INFO L93 Difference]: Finished difference Result 2619 states and 2802 transitions. [2021-01-06 19:23:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 19:23:51,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 565 [2021-01-06 19:23:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:51,979 INFO L225 Difference]: With dead ends: 2619 [2021-01-06 19:23:51,979 INFO L226 Difference]: Without dead ends: 2139 [2021-01-06 19:23:51,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 573 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2021-01-06 19:23:51,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2021-01-06 19:23:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1617. [2021-01-06 19:23:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2021-01-06 19:23:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 1720 transitions. [2021-01-06 19:23:52,173 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 1720 transitions. Word has length 565 [2021-01-06 19:23:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:52,174 INFO L481 AbstractCegarLoop]: Abstraction has 1617 states and 1720 transitions. [2021-01-06 19:23:52,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 19:23:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1720 transitions. [2021-01-06 19:23:52,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 624 [2021-01-06 19:23:52,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:52,178 INFO L422 BasicCegarLoop]: trace histogram [12, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:52,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-06 19:23:52,386 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:52,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:52,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2114825569, now seen corresponding path program 1 times [2021-01-06 19:23:52,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:52,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621762369] [2021-01-06 19:23:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 172 proven. 774 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-01-06 19:23:53,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621762369] [2021-01-06 19:23:53,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630552475] [2021-01-06 19:23:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:53,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 1734 conjuncts, 45 conjunts are in the unsatisfiable core [2021-01-06 19:23:53,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1150 backedges. 234 proven. 676 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-01-06 19:23:55,299 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:55,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 32 [2021-01-06 19:23:55,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891524613] [2021-01-06 19:23:55,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-01-06 19:23:55,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-01-06 19:23:55,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2021-01-06 19:23:55,303 INFO L87 Difference]: Start difference. First operand 1617 states and 1720 transitions. Second operand 32 states. [2021-01-06 19:23:57,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:23:57,040 INFO L93 Difference]: Finished difference Result 1863 states and 1983 transitions. [2021-01-06 19:23:57,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-01-06 19:23:57,040 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 623 [2021-01-06 19:23:57,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:23:57,043 INFO L225 Difference]: With dead ends: 1863 [2021-01-06 19:23:57,043 INFO L226 Difference]: Without dead ends: 1861 [2021-01-06 19:23:57,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 625 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=435, Invalid=3347, Unknown=0, NotChecked=0, Total=3782 [2021-01-06 19:23:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states. [2021-01-06 19:23:57,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1617. [2021-01-06 19:23:57,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2021-01-06 19:23:57,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 1719 transitions. [2021-01-06 19:23:57,257 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 1719 transitions. Word has length 623 [2021-01-06 19:23:57,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:23:57,257 INFO L481 AbstractCegarLoop]: Abstraction has 1617 states and 1719 transitions. [2021-01-06 19:23:57,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2021-01-06 19:23:57,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 1719 transitions. [2021-01-06 19:23:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 672 [2021-01-06 19:23:57,261 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:23:57,261 INFO L422 BasicCegarLoop]: trace histogram [13, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:23:57,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-06 19:23:57,462 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:23:57,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:23:57,464 INFO L82 PathProgramCache]: Analyzing trace with hash -874836839, now seen corresponding path program 1 times [2021-01-06 19:23:57,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:23:57,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138151328] [2021-01-06 19:23:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:23:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 454 proven. 208 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2021-01-06 19:23:58,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138151328] [2021-01-06 19:23:58,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478269755] [2021-01-06 19:23:58,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:23:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:23:58,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 1861 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-06 19:23:58,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:23:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 454 proven. 208 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2021-01-06 19:23:59,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:23:59,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2021-01-06 19:23:59,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338441868] [2021-01-06 19:23:59,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 19:23:59,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:23:59,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 19:23:59,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-01-06 19:23:59,480 INFO L87 Difference]: Start difference. First operand 1617 states and 1719 transitions. Second operand 11 states. [2021-01-06 19:24:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:00,268 INFO L93 Difference]: Finished difference Result 2259 states and 2407 transitions. [2021-01-06 19:24:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-01-06 19:24:00,268 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 671 [2021-01-06 19:24:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:00,271 INFO L225 Difference]: With dead ends: 2259 [2021-01-06 19:24:00,271 INFO L226 Difference]: Without dead ends: 1968 [2021-01-06 19:24:00,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 682 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2021-01-06 19:24:00,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2021-01-06 19:24:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1615. [2021-01-06 19:24:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2021-01-06 19:24:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 1709 transitions. [2021-01-06 19:24:00,458 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 1709 transitions. Word has length 671 [2021-01-06 19:24:00,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:00,459 INFO L481 AbstractCegarLoop]: Abstraction has 1615 states and 1709 transitions. [2021-01-06 19:24:00,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 19:24:00,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1709 transitions. [2021-01-06 19:24:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2021-01-06 19:24:00,465 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:00,465 INFO L422 BasicCegarLoop]: trace histogram [14, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:00,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:24:00,678 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:00,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:00,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1205159151, now seen corresponding path program 1 times [2021-01-06 19:24:00,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:00,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100061812] [2021-01-06 19:24:00,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:02,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 131 proven. 1372 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2021-01-06 19:24:02,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100061812] [2021-01-06 19:24:02,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638641268] [2021-01-06 19:24:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:24:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:02,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 2002 conjuncts, 57 conjunts are in the unsatisfiable core [2021-01-06 19:24:02,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:24:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 287 proven. 1198 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-01-06 19:24:04,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:24:04,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 38 [2021-01-06 19:24:04,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799361619] [2021-01-06 19:24:04,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2021-01-06 19:24:04,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:04,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-01-06 19:24:04,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1306, Unknown=0, NotChecked=0, Total=1406 [2021-01-06 19:24:04,362 INFO L87 Difference]: Start difference. First operand 1615 states and 1709 transitions. Second operand 38 states. [2021-01-06 19:24:06,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:06,568 INFO L93 Difference]: Finished difference Result 1871 states and 1982 transitions. [2021-01-06 19:24:06,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-01-06 19:24:06,569 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 730 [2021-01-06 19:24:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:06,572 INFO L225 Difference]: With dead ends: 1871 [2021-01-06 19:24:06,572 INFO L226 Difference]: Without dead ends: 1869 [2021-01-06 19:24:06,574 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 734 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1184 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=498, Invalid=4758, Unknown=0, NotChecked=0, Total=5256 [2021-01-06 19:24:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2021-01-06 19:24:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1615. [2021-01-06 19:24:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1615 states. [2021-01-06 19:24:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 1708 transitions. [2021-01-06 19:24:06,767 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 1708 transitions. Word has length 730 [2021-01-06 19:24:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:06,768 INFO L481 AbstractCegarLoop]: Abstraction has 1615 states and 1708 transitions. [2021-01-06 19:24:06,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2021-01-06 19:24:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 1708 transitions. [2021-01-06 19:24:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2021-01-06 19:24:06,774 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:06,774 INFO L422 BasicCegarLoop]: trace histogram [15, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:06,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2021-01-06 19:24:06,989 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:06,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:06,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1676282123, now seen corresponding path program 1 times [2021-01-06 19:24:06,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:06,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965023333] [2021-01-06 19:24:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 639 proven. 484 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2021-01-06 19:24:07,944 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965023333] [2021-01-06 19:24:07,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680700074] [2021-01-06 19:24:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:24:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:08,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 2129 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-06 19:24:08,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:24:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 639 proven. 484 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2021-01-06 19:24:09,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:24:09,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-01-06 19:24:09,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386353106] [2021-01-06 19:24:09,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 19:24:09,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:09,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 19:24:09,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2021-01-06 19:24:09,563 INFO L87 Difference]: Start difference. First operand 1615 states and 1708 transitions. Second operand 13 states. [2021-01-06 19:24:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:10,519 INFO L93 Difference]: Finished difference Result 1976 states and 2098 transitions. [2021-01-06 19:24:10,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-01-06 19:24:10,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 778 [2021-01-06 19:24:10,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:10,523 INFO L225 Difference]: With dead ends: 1976 [2021-01-06 19:24:10,523 INFO L226 Difference]: Without dead ends: 1874 [2021-01-06 19:24:10,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 817 GetRequests, 791 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2021-01-06 19:24:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2021-01-06 19:24:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1613. [2021-01-06 19:24:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1613 states. [2021-01-06 19:24:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 1699 transitions. [2021-01-06 19:24:10,743 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 1699 transitions. Word has length 778 [2021-01-06 19:24:10,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:10,744 INFO L481 AbstractCegarLoop]: Abstraction has 1613 states and 1699 transitions. [2021-01-06 19:24:10,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 19:24:10,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 1699 transitions. [2021-01-06 19:24:10,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 839 [2021-01-06 19:24:10,750 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:10,750 INFO L422 BasicCegarLoop]: trace histogram [16, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:10,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:24:10,951 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:10,952 INFO L82 PathProgramCache]: Analyzing trace with hash 771452747, now seen corresponding path program 1 times [2021-01-06 19:24:10,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:10,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160910066] [2021-01-06 19:24:10,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2093 backedges. 90 proven. 1978 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 19:24:13,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160910066] [2021-01-06 19:24:13,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646994923] [2021-01-06 19:24:13,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 19:24:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:13,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 2271 conjuncts, 69 conjunts are in the unsatisfiable core [2021-01-06 19:24:13,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 19:24:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2093 backedges. 248 proven. 1820 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-01-06 19:24:16,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 19:24:16,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 44 [2021-01-06 19:24:16,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112606498] [2021-01-06 19:24:16,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2021-01-06 19:24:16,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:16,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2021-01-06 19:24:16,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1774, Unknown=0, NotChecked=0, Total=1892 [2021-01-06 19:24:16,029 INFO L87 Difference]: Start difference. First operand 1613 states and 1699 transitions. Second operand 44 states. [2021-01-06 19:24:19,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:19,671 INFO L93 Difference]: Finished difference Result 1874 states and 1978 transitions. [2021-01-06 19:24:19,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-01-06 19:24:19,672 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 838 [2021-01-06 19:24:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:19,673 INFO L225 Difference]: With dead ends: 1874 [2021-01-06 19:24:19,673 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 19:24:19,677 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 940 GetRequests, 849 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1941 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=675, Invalid=7515, Unknown=0, NotChecked=0, Total=8190 [2021-01-06 19:24:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 19:24:19,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 19:24:19,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 19:24:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 19:24:19,677 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 838 [2021-01-06 19:24:19,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:19,678 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 19:24:19,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2021-01-06 19:24:19,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 19:24:19,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 19:24:19,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-01-06 19:24:19,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 19:24:20,040 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 111 [2021-01-06 19:24:20,946 WARN L197 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 128 [2021-01-06 19:24:21,049 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 112 [2021-01-06 19:24:21,513 WARN L197 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 272 DAG size of output: 242 [2021-01-06 19:24:21,866 WARN L197 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 204 [2021-01-06 19:24:23,946 WARN L197 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 713 DAG size of output: 568 [2021-01-06 19:24:24,075 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 172 [2021-01-06 19:24:26,850 WARN L197 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 832 DAG size of output: 612 [2021-01-06 19:24:28,681 WARN L197 SmtUtils]: Spent 1.82 s on a formula simplification. DAG size of input: 713 DAG size of output: 581 [2021-01-06 19:24:35,578 WARN L197 SmtUtils]: Spent 6.57 s on a formula simplification. DAG size of input: 1605 DAG size of output: 1287 [2021-01-06 19:24:35,765 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 209 [2021-01-06 19:24:36,094 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 276 [2021-01-06 19:24:36,447 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 204 [2021-01-06 19:24:37,720 WARN L197 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 544 DAG size of output: 455 [2021-01-06 19:24:37,829 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 172 [2021-01-06 19:24:39,678 WARN L197 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 693 DAG size of output: 544 [2021-01-06 19:24:39,892 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 201 [2021-01-06 19:24:41,787 WARN L197 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 709 DAG size of output: 577 [2021-01-06 19:24:43,544 WARN L197 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 713 DAG size of output: 581 [2021-01-06 19:24:44,193 WARN L197 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 451 DAG size of output: 382 [2021-01-06 19:24:44,640 WARN L197 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 350 DAG size of output: 323 [2021-01-06 19:24:46,623 WARN L197 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 693 DAG size of output: 544 [2021-01-06 19:24:46,824 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 222 DAG size of output: 183 [2021-01-06 19:24:48,761 WARN L197 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 693 DAG size of output: 544 [2021-01-06 19:24:48,903 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 192 [2021-01-06 19:24:49,052 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 234 [2021-01-06 19:24:49,853 WARN L197 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 489 [2021-01-06 19:24:54,651 WARN L197 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 1360 DAG size of output: 1093 [2021-01-06 19:24:56,603 WARN L197 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 693 DAG size of output: 544 [2021-01-06 19:24:58,534 WARN L197 SmtUtils]: Spent 1.93 s on a formula simplification. DAG size of input: 663 DAG size of output: 522 [2021-01-06 19:24:58,673 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 203 [2021-01-06 19:25:00,487 WARN L197 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 693 DAG size of output: 544 [2021-01-06 19:25:00,684 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 214 [2021-01-06 19:25:00,826 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 213 [2021-01-06 19:25:02,491 WARN L197 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 713 DAG size of output: 581 [2021-01-06 19:25:03,334 WARN L197 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 489 [2021-01-06 19:25:03,940 WARN L197 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 550 DAG size of output: 438 [2021-01-06 19:25:04,769 WARN L197 SmtUtils]: Spent 753.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 489 [2021-01-06 19:25:05,474 WARN L197 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 550 DAG size of output: 463 [2021-01-06 19:25:05,623 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 203 [2021-01-06 19:25:06,249 WARN L197 SmtUtils]: Spent 624.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 331 [2021-01-06 19:25:09,176 WARN L197 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 742 DAG size of output: 624 [2021-01-06 19:25:09,406 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 220 [2021-01-06 19:25:11,043 WARN L197 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 713 DAG size of output: 568 [2021-01-06 19:25:11,173 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 190 [2021-01-06 19:25:11,348 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 195 [2021-01-06 19:25:13,010 WARN L197 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 713 DAG size of output: 568 [2021-01-06 19:25:13,829 WARN L197 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 489 [2021-01-06 19:25:14,034 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 241 [2021-01-06 19:25:14,218 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 258 DAG size of output: 204 [2021-01-06 19:25:14,651 WARN L197 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 345 DAG size of output: 316 [2021-01-06 19:25:14,779 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 198 [2021-01-06 19:25:15,528 WARN L197 SmtUtils]: Spent 747.00 ms on a formula simplification. DAG size of input: 582 DAG size of output: 504 [2021-01-06 19:25:15,765 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 172 [2021-01-06 19:25:16,437 WARN L197 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 489 [2021-01-06 19:25:16,568 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 190 [2021-01-06 19:25:16,807 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 220 [2021-01-06 19:25:17,184 WARN L197 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2021-01-06 19:25:18,250 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 127 DAG size of output: 24 [2021-01-06 19:25:18,665 WARN L197 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2021-01-06 19:25:20,332 WARN L197 SmtUtils]: Spent 1.66 s on a formula simplification. DAG size of input: 240 DAG size of output: 125 [2021-01-06 19:25:21,692 WARN L197 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 200 DAG size of output: 121 [2021-01-06 19:25:29,258 WARN L197 SmtUtils]: Spent 7.56 s on a formula simplification. DAG size of input: 544 DAG size of output: 190 [2021-01-06 19:25:30,162 WARN L197 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2021-01-06 19:25:38,966 WARN L197 SmtUtils]: Spent 8.80 s on a formula simplification. DAG size of input: 588 DAG size of output: 188 [2021-01-06 19:25:46,523 WARN L197 SmtUtils]: Spent 7.55 s on a formula simplification. DAG size of input: 557 DAG size of output: 190 [2021-01-06 19:25:47,429 WARN L197 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2021-01-06 19:25:48,333 WARN L197 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 122 [2021-01-06 19:25:49,235 WARN L197 SmtUtils]: Spent 899.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 122 [2021-01-06 19:25:49,619 WARN L197 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 48 [2021-01-06 19:25:50,046 WARN L197 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2021-01-06 19:25:50,179 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-01-06 19:26:16,076 WARN L197 SmtUtils]: Spent 25.88 s on a formula simplification. DAG size of input: 1213 DAG size of output: 228 [2021-01-06 19:26:16,539 WARN L197 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2021-01-06 19:26:18,341 WARN L197 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 206 DAG size of output: 125 [2021-01-06 19:26:18,785 WARN L197 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2021-01-06 19:26:18,921 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-01-06 19:26:22,043 WARN L197 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 260 DAG size of output: 131 [2021-01-06 19:26:22,510 WARN L197 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2021-01-06 19:26:22,977 WARN L197 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2021-01-06 19:26:23,891 WARN L197 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2021-01-06 19:26:25,275 WARN L197 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 200 DAG size of output: 121 [2021-01-06 19:26:32,047 WARN L197 SmtUtils]: Spent 6.77 s on a formula simplification. DAG size of input: 437 DAG size of output: 175 [2021-01-06 19:26:32,953 WARN L197 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2021-01-06 19:26:39,880 WARN L197 SmtUtils]: Spent 6.92 s on a formula simplification. DAG size of input: 513 DAG size of output: 167 [2021-01-06 19:26:40,791 WARN L197 SmtUtils]: Spent 907.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 123 [2021-01-06 19:26:42,570 WARN L197 SmtUtils]: Spent 1.78 s on a formula simplification. DAG size of input: 197 DAG size of output: 122 [2021-01-06 19:26:50,199 WARN L197 SmtUtils]: Spent 7.62 s on a formula simplification. DAG size of input: 541 DAG size of output: 168 [2021-01-06 19:26:50,343 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2021-01-06 19:26:50,789 WARN L197 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2021-01-06 19:26:50,925 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2021-01-06 19:26:58,583 WARN L197 SmtUtils]: Spent 7.65 s on a formula simplification. DAG size of input: 557 DAG size of output: 190 [2021-01-06 19:26:59,028 WARN L197 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 78 [2021-01-06 19:26:59,167 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32