/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.5.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:29:17,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:29:17,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:29:17,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:29:17,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:29:17,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:29:17,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:29:17,977 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:29:17,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:29:17,981 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:29:17,982 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:29:17,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:29:17,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:29:17,986 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:29:17,987 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:29:17,989 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:29:17,990 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:29:18,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:29:18,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:29:18,032 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:29:18,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:29:18,042 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:29:18,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:29:18,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:29:18,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:29:18,059 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:29:18,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:29:18,066 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:29:18,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:29:18,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:29:18,072 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:29:18,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:29:18,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:29:18,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:29:18,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:29:18,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:29:18,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:29:18,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:29:18,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:29:18,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:29:18,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:29:18,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:29:18,144 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:29:18,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:29:18,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:29:18,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:29:18,149 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:29:18,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:29:18,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:29:18,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:29:18,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:29:18,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:29:18,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:29:18,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:29:18,153 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:29:18,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:29:18,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:29:18,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:29:18,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:29:18,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:29:18,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:29:18,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:29:18,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:29:18,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:29:18,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:29:18,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:29:18,156 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:29:18,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 09:29:18,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:29:18,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:29:18,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:29:18,604 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:29:18,608 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:29:18,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.5.cil.c [2020-12-23 09:29:18,707 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b5eaae50a/47f83cd7ef6543a590e97e53d19c6769/FLAG1e7017280 [2020-12-23 09:29:19,496 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:29:19,497 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.5.cil.c [2020-12-23 09:29:19,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b5eaae50a/47f83cd7ef6543a590e97e53d19c6769/FLAG1e7017280 [2020-12-23 09:29:19,778 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b5eaae50a/47f83cd7ef6543a590e97e53d19c6769 [2020-12-23 09:29:19,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:29:19,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:29:19,789 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:29:19,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:29:19,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:29:19,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:29:19" (1/1) ... [2020-12-23 09:29:19,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2402fddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:19, skipping insertion in model container [2020-12-23 09:29:19,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:29:19" (1/1) ... [2020-12-23 09:29:19,807 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:29:19,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:29:20,105 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.5.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[~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[~s_memory4~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,] [2020-12-23 09:29:20,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:29:20,312 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:29:20,328 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.5.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[~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[~s_memory4~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,] [2020-12-23 09:29:20,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:29:20,465 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:29:20,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20 WrapperNode [2020-12-23 09:29:20,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:29:20,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:29:20,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:29:20,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:29:20,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (1/1) ... [2020-12-23 09:29:20,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (1/1) ... [2020-12-23 09:29:20,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:29:20,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:29:20,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:29:20,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:29:20,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (1/1) ... [2020-12-23 09:29:20,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (1/1) ... [2020-12-23 09:29:20,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (1/1) ... [2020-12-23 09:29:20,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (1/1) ... [2020-12-23 09:29:20,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (1/1) ... [2020-12-23 09:29:20,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (1/1) ... [2020-12-23 09:29:20,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (1/1) ... [2020-12-23 09:29:20,709 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:29:20,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:29:20,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:29:20,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:29:20,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:29:20,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:29:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:29:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:29:20,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:29:22,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:29:22,030 INFO L299 CfgBuilder]: Removed 39 assume(true) statements. [2020-12-23 09:29:22,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:29:22 BoogieIcfgContainer [2020-12-23 09:29:22,032 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:29:22,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:29:22,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:29:22,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:29:22,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:29:19" (1/3) ... [2020-12-23 09:29:22,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506e902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:29:22, skipping insertion in model container [2020-12-23 09:29:22,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:29:20" (2/3) ... [2020-12-23 09:29:22,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@506e902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:29:22, skipping insertion in model container [2020-12-23 09:29:22,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:29:22" (3/3) ... [2020-12-23 09:29:22,043 INFO L111 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.5.cil.c [2020-12-23 09:29:22,051 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:29:22,058 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-12-23 09:29:22,084 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-12-23 09:29:22,118 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:29:22,118 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:29:22,118 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:29:22,118 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:29:22,119 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:29:22,119 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:29:22,119 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:29:22,119 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:29:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states. [2020-12-23 09:29:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-12-23 09:29:22,156 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:22,157 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] [2020-12-23 09:29:22,157 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]=== [2020-12-23 09:29:22,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash -963603713, now seen corresponding path program 1 times [2020-12-23 09:29:22,177 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:22,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114325679] [2020-12-23 09:29:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:22,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114325679] [2020-12-23 09:29:22,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:22,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:22,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705777556] [2020-12-23 09:29:22,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:22,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:22,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:22,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:22,478 INFO L87 Difference]: Start difference. First operand 278 states. Second operand 3 states. [2020-12-23 09:29:22,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:22,989 INFO L93 Difference]: Finished difference Result 737 states and 1340 transitions. [2020-12-23 09:29:22,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:22,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-12-23 09:29:22,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:23,009 INFO L225 Difference]: With dead ends: 737 [2020-12-23 09:29:23,010 INFO L226 Difference]: Without dead ends: 456 [2020-12-23 09:29:23,015 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 [2020-12-23 09:29:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2020-12-23 09:29:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 440. [2020-12-23 09:29:23,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-12-23 09:29:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 698 transitions. [2020-12-23 09:29:23,120 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 698 transitions. Word has length 28 [2020-12-23 09:29:23,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:23,121 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 698 transitions. [2020-12-23 09:29:23,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 698 transitions. [2020-12-23 09:29:23,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-12-23 09:29:23,124 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:23,125 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] [2020-12-23 09:29:23,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:29:23,125 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]=== [2020-12-23 09:29:23,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:23,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1271304470, now seen corresponding path program 1 times [2020-12-23 09:29:23,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:23,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274306482] [2020-12-23 09:29:23,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:23,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274306482] [2020-12-23 09:29:23,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:23,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:23,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989567208] [2020-12-23 09:29:23,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:23,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:23,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:23,216 INFO L87 Difference]: Start difference. First operand 440 states and 698 transitions. Second operand 3 states. [2020-12-23 09:29:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:23,387 INFO L93 Difference]: Finished difference Result 1159 states and 1863 transitions. [2020-12-23 09:29:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:23,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-12-23 09:29:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:23,393 INFO L225 Difference]: With dead ends: 1159 [2020-12-23 09:29:23,393 INFO L226 Difference]: Without dead ends: 733 [2020-12-23 09:29:23,395 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 [2020-12-23 09:29:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2020-12-23 09:29:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 717. [2020-12-23 09:29:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2020-12-23 09:29:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1169 transitions. [2020-12-23 09:29:23,458 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1169 transitions. Word has length 40 [2020-12-23 09:29:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:23,460 INFO L481 AbstractCegarLoop]: Abstraction has 717 states and 1169 transitions. [2020-12-23 09:29:23,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1169 transitions. [2020-12-23 09:29:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-23 09:29:23,466 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:23,466 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] [2020-12-23 09:29:23,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:29:23,469 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]=== [2020-12-23 09:29:23,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:23,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1281078165, now seen corresponding path program 1 times [2020-12-23 09:29:23,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:23,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206832830] [2020-12-23 09:29:23,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:23,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206832830] [2020-12-23 09:29:23,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:23,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:23,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663553905] [2020-12-23 09:29:23,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:23,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:23,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:23,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:23,583 INFO L87 Difference]: Start difference. First operand 717 states and 1169 transitions. Second operand 3 states. [2020-12-23 09:29:23,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:23,658 INFO L93 Difference]: Finished difference Result 1795 states and 2924 transitions. [2020-12-23 09:29:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:23,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2020-12-23 09:29:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:23,665 INFO L225 Difference]: With dead ends: 1795 [2020-12-23 09:29:23,665 INFO L226 Difference]: Without dead ends: 1103 [2020-12-23 09:29:23,667 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 [2020-12-23 09:29:23,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2020-12-23 09:29:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1091. [2020-12-23 09:29:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1091 states. [2020-12-23 09:29:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1091 states to 1091 states and 1772 transitions. [2020-12-23 09:29:23,712 INFO L78 Accepts]: Start accepts. Automaton has 1091 states and 1772 transitions. Word has length 41 [2020-12-23 09:29:23,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:23,713 INFO L481 AbstractCegarLoop]: Abstraction has 1091 states and 1772 transitions. [2020-12-23 09:29:23,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1091 states and 1772 transitions. [2020-12-23 09:29:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-23 09:29:23,715 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:23,715 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] [2020-12-23 09:29:23,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:29:23,715 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]=== [2020-12-23 09:29:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:23,716 INFO L82 PathProgramCache]: Analyzing trace with hash -154905712, now seen corresponding path program 1 times [2020-12-23 09:29:23,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:23,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608493184] [2020-12-23 09:29:23,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:23,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608493184] [2020-12-23 09:29:23,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:23,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:23,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673951192] [2020-12-23 09:29:23,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:23,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:23,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:23,786 INFO L87 Difference]: Start difference. First operand 1091 states and 1772 transitions. Second operand 4 states. [2020-12-23 09:29:24,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:24,215 INFO L93 Difference]: Finished difference Result 3005 states and 4865 transitions. [2020-12-23 09:29:24,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:29:24,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2020-12-23 09:29:24,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:24,226 INFO L225 Difference]: With dead ends: 3005 [2020-12-23 09:29:24,227 INFO L226 Difference]: Without dead ends: 1939 [2020-12-23 09:29:24,229 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 [2020-12-23 09:29:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2020-12-23 09:29:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1709. [2020-12-23 09:29:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1709 states. [2020-12-23 09:29:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2744 transitions. [2020-12-23 09:29:24,337 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2744 transitions. Word has length 46 [2020-12-23 09:29:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:24,338 INFO L481 AbstractCegarLoop]: Abstraction has 1709 states and 2744 transitions. [2020-12-23 09:29:24,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2744 transitions. [2020-12-23 09:29:24,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 09:29:24,339 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:24,340 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] [2020-12-23 09:29:24,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:29:24,340 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]=== [2020-12-23 09:29:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash 796224946, now seen corresponding path program 1 times [2020-12-23 09:29:24,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:24,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297192722] [2020-12-23 09:29:24,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:24,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297192722] [2020-12-23 09:29:24,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:24,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:24,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189324598] [2020-12-23 09:29:24,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:24,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:24,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:24,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:24,460 INFO L87 Difference]: Start difference. First operand 1709 states and 2744 transitions. Second operand 4 states. [2020-12-23 09:29:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:25,058 INFO L93 Difference]: Finished difference Result 5093 states and 8076 transitions. [2020-12-23 09:29:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:29:25,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-12-23 09:29:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:25,080 INFO L225 Difference]: With dead ends: 5093 [2020-12-23 09:29:25,080 INFO L226 Difference]: Without dead ends: 3403 [2020-12-23 09:29:25,083 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 [2020-12-23 09:29:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3403 states. [2020-12-23 09:29:25,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3403 to 3017. [2020-12-23 09:29:25,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3017 states. [2020-12-23 09:29:25,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 4775 transitions. [2020-12-23 09:29:25,241 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 4775 transitions. Word has length 52 [2020-12-23 09:29:25,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:25,241 INFO L481 AbstractCegarLoop]: Abstraction has 3017 states and 4775 transitions. [2020-12-23 09:29:25,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 4775 transitions. [2020-12-23 09:29:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-12-23 09:29:25,244 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:25,244 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] [2020-12-23 09:29:25,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:29:25,245 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]=== [2020-12-23 09:29:25,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:25,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1351345783, now seen corresponding path program 1 times [2020-12-23 09:29:25,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:25,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707582361] [2020-12-23 09:29:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:25,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707582361] [2020-12-23 09:29:25,359 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:25,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:25,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984221148] [2020-12-23 09:29:25,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:25,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:25,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:25,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:25,361 INFO L87 Difference]: Start difference. First operand 3017 states and 4775 transitions. Second operand 3 states. [2020-12-23 09:29:25,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:25,593 INFO L93 Difference]: Finished difference Result 7103 states and 11202 transitions. [2020-12-23 09:29:25,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:25,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-12-23 09:29:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:25,614 INFO L225 Difference]: With dead ends: 7103 [2020-12-23 09:29:25,614 INFO L226 Difference]: Without dead ends: 4109 [2020-12-23 09:29:25,619 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 [2020-12-23 09:29:25,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2020-12-23 09:29:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 3925. [2020-12-23 09:29:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3925 states. [2020-12-23 09:29:25,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3925 states to 3925 states and 6141 transitions. [2020-12-23 09:29:25,827 INFO L78 Accepts]: Start accepts. Automaton has 3925 states and 6141 transitions. Word has length 52 [2020-12-23 09:29:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:25,828 INFO L481 AbstractCegarLoop]: Abstraction has 3925 states and 6141 transitions. [2020-12-23 09:29:25,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:25,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3925 states and 6141 transitions. [2020-12-23 09:29:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-12-23 09:29:25,831 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:25,832 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] [2020-12-23 09:29:25,832 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:29:25,832 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]=== [2020-12-23 09:29:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:25,833 INFO L82 PathProgramCache]: Analyzing trace with hash 597787097, now seen corresponding path program 1 times [2020-12-23 09:29:25,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:25,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522850406] [2020-12-23 09:29:25,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:25,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522850406] [2020-12-23 09:29:25,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:25,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:25,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269504500] [2020-12-23 09:29:25,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:25,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:25,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:25,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:25,928 INFO L87 Difference]: Start difference. First operand 3925 states and 6141 transitions. Second operand 3 states. [2020-12-23 09:29:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:26,496 INFO L93 Difference]: Finished difference Result 9443 states and 14897 transitions. [2020-12-23 09:29:26,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:26,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2020-12-23 09:29:26,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:26,530 INFO L225 Difference]: With dead ends: 9443 [2020-12-23 09:29:26,530 INFO L226 Difference]: Without dead ends: 5541 [2020-12-23 09:29:26,538 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 [2020-12-23 09:29:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5541 states. [2020-12-23 09:29:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5541 to 4755. [2020-12-23 09:29:26,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4755 states. [2020-12-23 09:29:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4755 states to 4755 states and 7178 transitions. [2020-12-23 09:29:26,767 INFO L78 Accepts]: Start accepts. Automaton has 4755 states and 7178 transitions. Word has length 60 [2020-12-23 09:29:26,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:26,768 INFO L481 AbstractCegarLoop]: Abstraction has 4755 states and 7178 transitions. [2020-12-23 09:29:26,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:26,768 INFO L276 IsEmpty]: Start isEmpty. Operand 4755 states and 7178 transitions. [2020-12-23 09:29:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 09:29:26,771 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:26,771 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] [2020-12-23 09:29:26,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:29:26,771 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]=== [2020-12-23 09:29:26,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:26,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2030496955, now seen corresponding path program 1 times [2020-12-23 09:29:26,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:26,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944526489] [2020-12-23 09:29:26,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:26,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944526489] [2020-12-23 09:29:26,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:26,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:26,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442182400] [2020-12-23 09:29:26,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:26,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:26,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:26,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:26,840 INFO L87 Difference]: Start difference. First operand 4755 states and 7178 transitions. Second operand 3 states. [2020-12-23 09:29:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:27,126 INFO L93 Difference]: Finished difference Result 9353 states and 14133 transitions. [2020-12-23 09:29:27,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:27,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-12-23 09:29:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:27,153 INFO L225 Difference]: With dead ends: 9353 [2020-12-23 09:29:27,153 INFO L226 Difference]: Without dead ends: 4621 [2020-12-23 09:29:27,162 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 [2020-12-23 09:29:27,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4621 states. [2020-12-23 09:29:27,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4621 to 4621. [2020-12-23 09:29:27,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4621 states. [2020-12-23 09:29:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4621 states to 4621 states and 6877 transitions. [2020-12-23 09:29:27,485 INFO L78 Accepts]: Start accepts. Automaton has 4621 states and 6877 transitions. Word has length 62 [2020-12-23 09:29:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:27,485 INFO L481 AbstractCegarLoop]: Abstraction has 4621 states and 6877 transitions. [2020-12-23 09:29:27,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 6877 transitions. [2020-12-23 09:29:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 09:29:27,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:27,489 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] [2020-12-23 09:29:27,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:29:27,490 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]=== [2020-12-23 09:29:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:27,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1137929187, now seen corresponding path program 1 times [2020-12-23 09:29:27,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:27,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609850783] [2020-12-23 09:29:27,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:27,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609850783] [2020-12-23 09:29:27,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:27,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:27,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029332710] [2020-12-23 09:29:27,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:27,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:27,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:27,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:27,527 INFO L87 Difference]: Start difference. First operand 4621 states and 6877 transitions. Second operand 3 states. [2020-12-23 09:29:27,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:27,784 INFO L93 Difference]: Finished difference Result 9889 states and 14872 transitions. [2020-12-23 09:29:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:27,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-12-23 09:29:27,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:27,812 INFO L225 Difference]: With dead ends: 9889 [2020-12-23 09:29:27,812 INFO L226 Difference]: Without dead ends: 5291 [2020-12-23 09:29:27,822 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 [2020-12-23 09:29:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2020-12-23 09:29:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 3543. [2020-12-23 09:29:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3543 states. [2020-12-23 09:29:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 5319 transitions. [2020-12-23 09:29:28,111 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 5319 transitions. Word has length 63 [2020-12-23 09:29:28,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:28,112 INFO L481 AbstractCegarLoop]: Abstraction has 3543 states and 5319 transitions. [2020-12-23 09:29:28,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:28,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 5319 transitions. [2020-12-23 09:29:28,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-23 09:29:28,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:28,114 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] [2020-12-23 09:29:28,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:29:28,115 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]=== [2020-12-23 09:29:28,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:28,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2053707672, now seen corresponding path program 1 times [2020-12-23 09:29:28,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:28,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982022571] [2020-12-23 09:29:28,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:28,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982022571] [2020-12-23 09:29:28,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:28,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:29:28,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869407389] [2020-12-23 09:29:28,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:29:28,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:28,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:29:28,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:28,187 INFO L87 Difference]: Start difference. First operand 3543 states and 5319 transitions. Second operand 6 states. [2020-12-23 09:29:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:29,514 INFO L93 Difference]: Finished difference Result 16685 states and 24815 transitions. [2020-12-23 09:29:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 09:29:29,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-12-23 09:29:29,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:29,546 INFO L225 Difference]: With dead ends: 16685 [2020-12-23 09:29:29,546 INFO L226 Difference]: Without dead ends: 13361 [2020-12-23 09:29:29,554 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 [2020-12-23 09:29:29,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13361 states. [2020-12-23 09:29:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13361 to 4409. [2020-12-23 09:29:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2020-12-23 09:29:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 6577 transitions. [2020-12-23 09:29:29,848 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 6577 transitions. Word has length 65 [2020-12-23 09:29:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:29,848 INFO L481 AbstractCegarLoop]: Abstraction has 4409 states and 6577 transitions. [2020-12-23 09:29:29,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:29:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 6577 transitions. [2020-12-23 09:29:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-23 09:29:29,850 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:29,850 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, 1] [2020-12-23 09:29:29,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:29:29,851 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]=== [2020-12-23 09:29:29,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:29,851 INFO L82 PathProgramCache]: Analyzing trace with hash 308353685, now seen corresponding path program 1 times [2020-12-23 09:29:29,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:29,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995013891] [2020-12-23 09:29:29,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:29,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995013891] [2020-12-23 09:29:29,911 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:29,911 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:29:29,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796255069] [2020-12-23 09:29:29,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:29:29,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:29,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:29:29,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:29:29,913 INFO L87 Difference]: Start difference. First operand 4409 states and 6577 transitions. Second operand 7 states. [2020-12-23 09:29:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:31,969 INFO L93 Difference]: Finished difference Result 30225 states and 44734 transitions. [2020-12-23 09:29:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-23 09:29:31,969 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2020-12-23 09:29:31,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:32,042 INFO L225 Difference]: With dead ends: 30225 [2020-12-23 09:29:32,042 INFO L226 Difference]: Without dead ends: 26035 [2020-12-23 09:29:32,055 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 [2020-12-23 09:29:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26035 states. [2020-12-23 09:29:32,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26035 to 4717. [2020-12-23 09:29:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4717 states. [2020-12-23 09:29:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4717 states to 4717 states and 6987 transitions. [2020-12-23 09:29:32,590 INFO L78 Accepts]: Start accepts. Automaton has 4717 states and 6987 transitions. Word has length 66 [2020-12-23 09:29:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:32,591 INFO L481 AbstractCegarLoop]: Abstraction has 4717 states and 6987 transitions. [2020-12-23 09:29:32,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:29:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 4717 states and 6987 transitions. [2020-12-23 09:29:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-12-23 09:29:32,593 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:32,594 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] [2020-12-23 09:29:32,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:29:32,594 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]=== [2020-12-23 09:29:32,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:32,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1102042814, now seen corresponding path program 1 times [2020-12-23 09:29:32,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:32,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407388586] [2020-12-23 09:29:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:32,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:32,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407388586] [2020-12-23 09:29:32,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:32,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:32,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824982226] [2020-12-23 09:29:32,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:32,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:32,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:32,629 INFO L87 Difference]: Start difference. First operand 4717 states and 6987 transitions. Second operand 3 states. [2020-12-23 09:29:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:32,998 INFO L93 Difference]: Finished difference Result 9956 states and 14724 transitions. [2020-12-23 09:29:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:32,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2020-12-23 09:29:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:33,011 INFO L225 Difference]: With dead ends: 9956 [2020-12-23 09:29:33,011 INFO L226 Difference]: Without dead ends: 5260 [2020-12-23 09:29:33,019 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 [2020-12-23 09:29:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2020-12-23 09:29:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 5186. [2020-12-23 09:29:33,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5186 states. [2020-12-23 09:29:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5186 states to 5186 states and 7664 transitions. [2020-12-23 09:29:33,444 INFO L78 Accepts]: Start accepts. Automaton has 5186 states and 7664 transitions. Word has length 77 [2020-12-23 09:29:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:33,444 INFO L481 AbstractCegarLoop]: Abstraction has 5186 states and 7664 transitions. [2020-12-23 09:29:33,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 5186 states and 7664 transitions. [2020-12-23 09:29:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2020-12-23 09:29:33,447 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:33,447 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] [2020-12-23 09:29:33,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:29:33,447 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]=== [2020-12-23 09:29:33,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:33,448 INFO L82 PathProgramCache]: Analyzing trace with hash 348611025, now seen corresponding path program 1 times [2020-12-23 09:29:33,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:33,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514696130] [2020-12-23 09:29:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:33,503 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:33,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514696130] [2020-12-23 09:29:33,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:33,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:29:33,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872843633] [2020-12-23 09:29:33,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:29:33,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:33,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:29:33,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:29:33,506 INFO L87 Difference]: Start difference. First operand 5186 states and 7664 transitions. Second operand 4 states. [2020-12-23 09:29:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:34,347 INFO L93 Difference]: Finished difference Result 13878 states and 20348 transitions. [2020-12-23 09:29:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:29:34,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2020-12-23 09:29:34,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:34,370 INFO L225 Difference]: With dead ends: 13878 [2020-12-23 09:29:34,371 INFO L226 Difference]: Without dead ends: 8592 [2020-12-23 09:29:34,380 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 [2020-12-23 09:29:34,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8592 states. [2020-12-23 09:29:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8592 to 7621. [2020-12-23 09:29:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7621 states. [2020-12-23 09:29:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7621 states to 7621 states and 11024 transitions. [2020-12-23 09:29:34,924 INFO L78 Accepts]: Start accepts. Automaton has 7621 states and 11024 transitions. Word has length 88 [2020-12-23 09:29:34,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:34,925 INFO L481 AbstractCegarLoop]: Abstraction has 7621 states and 11024 transitions. [2020-12-23 09:29:34,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:29:34,925 INFO L276 IsEmpty]: Start isEmpty. Operand 7621 states and 11024 transitions. [2020-12-23 09:29:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-23 09:29:34,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:34,929 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] [2020-12-23 09:29:34,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:29:34,929 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]=== [2020-12-23 09:29:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash 766561691, now seen corresponding path program 1 times [2020-12-23 09:29:34,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:34,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474364319] [2020-12-23 09:29:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:34,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474364319] [2020-12-23 09:29:34,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:34,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:29:34,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083011193] [2020-12-23 09:29:34,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:34,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:34,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:34,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:29:34,986 INFO L87 Difference]: Start difference. First operand 7621 states and 11024 transitions. Second operand 3 states. [2020-12-23 09:29:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:35,308 INFO L93 Difference]: Finished difference Result 10976 states and 15901 transitions. [2020-12-23 09:29:35,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:35,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-12-23 09:29:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:35,317 INFO L225 Difference]: With dead ends: 10976 [2020-12-23 09:29:35,317 INFO L226 Difference]: Without dead ends: 3363 [2020-12-23 09:29:35,325 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 [2020-12-23 09:29:35,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3363 states. [2020-12-23 09:29:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3363 to 3310. [2020-12-23 09:29:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3310 states. [2020-12-23 09:29:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4481 transitions. [2020-12-23 09:29:35,517 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4481 transitions. Word has length 95 [2020-12-23 09:29:35,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:35,518 INFO L481 AbstractCegarLoop]: Abstraction has 3310 states and 4481 transitions. [2020-12-23 09:29:35,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4481 transitions. [2020-12-23 09:29:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-23 09:29:35,519 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:35,520 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] [2020-12-23 09:29:35,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:29:35,520 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]=== [2020-12-23 09:29:35,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash 826534791, now seen corresponding path program 1 times [2020-12-23 09:29:35,521 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:35,521 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135909911] [2020-12-23 09:29:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:35,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135909911] [2020-12-23 09:29:35,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:29:35,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:29:35,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622969447] [2020-12-23 09:29:35,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:29:35,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:35,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:29:35,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:29:35,569 INFO L87 Difference]: Start difference. First operand 3310 states and 4481 transitions. Second operand 5 states. [2020-12-23 09:29:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:36,169 INFO L93 Difference]: Finished difference Result 12609 states and 17059 transitions. [2020-12-23 09:29:36,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-23 09:29:36,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-23 09:29:36,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:36,187 INFO L225 Difference]: With dead ends: 12609 [2020-12-23 09:29:36,187 INFO L226 Difference]: Without dead ends: 9473 [2020-12-23 09:29:36,196 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 [2020-12-23 09:29:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9473 states. [2020-12-23 09:29:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9473 to 3312. [2020-12-23 09:29:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-12-23 09:29:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 4477 transitions. [2020-12-23 09:29:36,544 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 4477 transitions. Word has length 98 [2020-12-23 09:29:36,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:36,545 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 4477 transitions. [2020-12-23 09:29:36,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:29:36,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 4477 transitions. [2020-12-23 09:29:36,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:29:36,547 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:36,547 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] [2020-12-23 09:29:36,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:29:36,547 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]=== [2020-12-23 09:29:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:36,548 INFO L82 PathProgramCache]: Analyzing trace with hash -313074590, now seen corresponding path program 1 times [2020-12-23 09:29:36,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:36,548 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934392590] [2020-12-23 09:29:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:36,614 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934392590] [2020-12-23 09:29:36,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042747682] [2020-12-23 09:29:36,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 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 [2020-12-23 09:29:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:36,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:29:36,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:36,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:36,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 09:29:36,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532229406] [2020-12-23 09:29:36,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:36,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:36,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:36,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:36,943 INFO L87 Difference]: Start difference. First operand 3312 states and 4477 transitions. Second operand 3 states. [2020-12-23 09:29:37,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:37,428 INFO L93 Difference]: Finished difference Result 3955 states and 5340 transitions. [2020-12-23 09:29:37,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:37,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 09:29:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:37,435 INFO L225 Difference]: With dead ends: 3955 [2020-12-23 09:29:37,435 INFO L226 Difference]: Without dead ends: 3951 [2020-12-23 09:29:37,437 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 [2020-12-23 09:29:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3951 states. [2020-12-23 09:29:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3951 to 3901. [2020-12-23 09:29:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3901 states. [2020-12-23 09:29:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 5264 transitions. [2020-12-23 09:29:37,831 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 5264 transitions. Word has length 100 [2020-12-23 09:29:37,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:37,831 INFO L481 AbstractCegarLoop]: Abstraction has 3901 states and 5264 transitions. [2020-12-23 09:29:37,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 5264 transitions. [2020-12-23 09:29:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-12-23 09:29:37,835 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:37,836 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, 1] [2020-12-23 09:29:38,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-12-23 09:29:38,051 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]=== [2020-12-23 09:29:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash -190497954, now seen corresponding path program 1 times [2020-12-23 09:29:38,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:38,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130196574] [2020-12-23 09:29:38,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:29:38,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130196574] [2020-12-23 09:29:38,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761031482] [2020-12-23 09:29:38,157 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 [2020-12-23 09:29:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:38,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:29:38,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:38,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:38,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 09:29:38,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390257998] [2020-12-23 09:29:38,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:38,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:38,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:38,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:38,460 INFO L87 Difference]: Start difference. First operand 3901 states and 5264 transitions. Second operand 3 states. [2020-12-23 09:29:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:38,766 INFO L93 Difference]: Finished difference Result 6951 states and 9433 transitions. [2020-12-23 09:29:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:38,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-12-23 09:29:38,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:38,771 INFO L225 Difference]: With dead ends: 6951 [2020-12-23 09:29:38,771 INFO L226 Difference]: Without dead ends: 3059 [2020-12-23 09:29:38,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2020-12-23 09:29:39,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2838. [2020-12-23 09:29:39,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2838 states. [2020-12-23 09:29:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3776 transitions. [2020-12-23 09:29:39,039 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3776 transitions. Word has length 156 [2020-12-23 09:29:39,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:39,039 INFO L481 AbstractCegarLoop]: Abstraction has 2838 states and 3776 transitions. [2020-12-23 09:29:39,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3776 transitions. [2020-12-23 09:29:39,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-12-23 09:29:39,042 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:39,042 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, 1] [2020-12-23 09:29:39,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2020-12-23 09:29:39,258 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]=== [2020-12-23 09:29:39,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:39,259 INFO L82 PathProgramCache]: Analyzing trace with hash -458245749, now seen corresponding path program 1 times [2020-12-23 09:29:39,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:39,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094635643] [2020-12-23 09:29:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:39,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094635643] [2020-12-23 09:29:39,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896159154] [2020-12-23 09:29:39,350 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 [2020-12-23 09:29:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:39,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:29:39,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 09:29:39,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:39,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 09:29:39,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706329346] [2020-12-23 09:29:39,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:39,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:39,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:39,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:39,674 INFO L87 Difference]: Start difference. First operand 2838 states and 3776 transitions. Second operand 3 states. [2020-12-23 09:29:39,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:39,976 INFO L93 Difference]: Finished difference Result 5507 states and 7368 transitions. [2020-12-23 09:29:39,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:39,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2020-12-23 09:29:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:39,981 INFO L225 Difference]: With dead ends: 5507 [2020-12-23 09:29:39,981 INFO L226 Difference]: Without dead ends: 2838 [2020-12-23 09:29:39,984 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 [2020-12-23 09:29:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2020-12-23 09:29:40,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2838. [2020-12-23 09:29:40,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2838 states. [2020-12-23 09:29:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 3680 transitions. [2020-12-23 09:29:40,150 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 3680 transitions. Word has length 159 [2020-12-23 09:29:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:40,150 INFO L481 AbstractCegarLoop]: Abstraction has 2838 states and 3680 transitions. [2020-12-23 09:29:40,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 3680 transitions. [2020-12-23 09:29:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2020-12-23 09:29:40,153 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:40,154 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, 1] [2020-12-23 09:29:40,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2020-12-23 09:29:40,370 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]=== [2020-12-23 09:29:40,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:40,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1040089916, now seen corresponding path program 1 times [2020-12-23 09:29:40,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:40,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704695141] [2020-12-23 09:29:40,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:40,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704695141] [2020-12-23 09:29:40,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261602495] [2020-12-23 09:29:40,456 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 [2020-12-23 09:29:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:40,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-23 09:29:40,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 09:29:40,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:29:40,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-12-23 09:29:40,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381036479] [2020-12-23 09:29:40,731 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:29:40,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:40,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:29:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:40,732 INFO L87 Difference]: Start difference. First operand 2838 states and 3680 transitions. Second operand 3 states. [2020-12-23 09:29:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:41,458 INFO L93 Difference]: Finished difference Result 6422 states and 8493 transitions. [2020-12-23 09:29:41,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:29:41,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2020-12-23 09:29:41,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:41,464 INFO L225 Difference]: With dead ends: 6422 [2020-12-23 09:29:41,464 INFO L226 Difference]: Without dead ends: 3753 [2020-12-23 09:29:41,469 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:29:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3753 states. [2020-12-23 09:29:41,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3753 to 3662. [2020-12-23 09:29:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3662 states. [2020-12-23 09:29:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 4641 transitions. [2020-12-23 09:29:41,913 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 4641 transitions. Word has length 160 [2020-12-23 09:29:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:41,913 INFO L481 AbstractCegarLoop]: Abstraction has 3662 states and 4641 transitions. [2020-12-23 09:29:41,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:29:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4641 transitions. [2020-12-23 09:29:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-12-23 09:29:41,920 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:41,921 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, 1] [2020-12-23 09:29:42,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:42,136 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]=== [2020-12-23 09:29:42,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:42,137 INFO L82 PathProgramCache]: Analyzing trace with hash 225096567, now seen corresponding path program 1 times [2020-12-23 09:29:42,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:42,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618736398] [2020-12-23 09:29:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:42,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618736398] [2020-12-23 09:29:42,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880335883] [2020-12-23 09:29:42,370 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 [2020-12-23 09:29:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:42,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 09:29:42,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 5 proven. 43 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:29:42,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:42,787 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-12-23 09:29:42,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37730712] [2020-12-23 09:29:42,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:29:42,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:42,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:29:42,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:29:42,789 INFO L87 Difference]: Start difference. First operand 3662 states and 4641 transitions. Second operand 9 states. [2020-12-23 09:29:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:45,006 INFO L93 Difference]: Finished difference Result 18380 states and 23381 transitions. [2020-12-23 09:29:45,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-12-23 09:29:45,007 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2020-12-23 09:29:45,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:45,053 INFO L225 Difference]: With dead ends: 18380 [2020-12-23 09:29:45,053 INFO L226 Difference]: Without dead ends: 14887 [2020-12-23 09:29:45,061 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2020-12-23 09:29:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14887 states. [2020-12-23 09:29:45,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14887 to 5193. [2020-12-23 09:29:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5193 states. [2020-12-23 09:29:45,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5193 states to 5193 states and 6612 transitions. [2020-12-23 09:29:45,625 INFO L78 Accepts]: Start accepts. Automaton has 5193 states and 6612 transitions. Word has length 162 [2020-12-23 09:29:45,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:45,625 INFO L481 AbstractCegarLoop]: Abstraction has 5193 states and 6612 transitions. [2020-12-23 09:29:45,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:29:45,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5193 states and 6612 transitions. [2020-12-23 09:29:45,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2020-12-23 09:29:45,630 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:45,630 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, 1] [2020-12-23 09:29:45,843 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:45,844 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]=== [2020-12-23 09:29:45,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2103811804, now seen corresponding path program 1 times [2020-12-23 09:29:45,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:45,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615109520] [2020-12-23 09:29:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:29:46,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615109520] [2020-12-23 09:29:46,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019326579] [2020-12-23 09:29:46,171 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 [2020-12-23 09:29:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:46,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-23 09:29:46,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 10 proven. 192 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:29:46,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:46,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-12-23 09:29:46,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392326066] [2020-12-23 09:29:46,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:29:46,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:46,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:29:46,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:29:46,754 INFO L87 Difference]: Start difference. First operand 5193 states and 6612 transitions. Second operand 11 states. [2020-12-23 09:29:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:49,539 INFO L93 Difference]: Finished difference Result 23937 states and 30355 transitions. [2020-12-23 09:29:49,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-12-23 09:29:49,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 260 [2020-12-23 09:29:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:49,562 INFO L225 Difference]: With dead ends: 23937 [2020-12-23 09:29:49,562 INFO L226 Difference]: Without dead ends: 18913 [2020-12-23 09:29:49,571 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=1631, Unknown=0, NotChecked=0, Total=1892 [2020-12-23 09:29:49,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18913 states. [2020-12-23 09:29:50,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18913 to 6601. [2020-12-23 09:29:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6601 states. [2020-12-23 09:29:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 8416 transitions. [2020-12-23 09:29:50,410 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 8416 transitions. Word has length 260 [2020-12-23 09:29:50,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:50,411 INFO L481 AbstractCegarLoop]: Abstraction has 6601 states and 8416 transitions. [2020-12-23 09:29:50,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:29:50,411 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 8416 transitions. [2020-12-23 09:29:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2020-12-23 09:29:50,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:50,415 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, 1] [2020-12-23 09:29:50,620 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:50,621 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]=== [2020-12-23 09:29:50,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:50,622 INFO L82 PathProgramCache]: Analyzing trace with hash 705037150, now seen corresponding path program 1 times [2020-12-23 09:29:50,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:50,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842039953] [2020-12-23 09:29:50,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 15 proven. 448 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 09:29:51,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842039953] [2020-12-23 09:29:51,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589764955] [2020-12-23 09:29:51,108 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 [2020-12-23 09:29:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:51,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-23 09:29:51,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:51,865 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 15 proven. 448 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-12-23 09:29:51,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:51,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2020-12-23 09:29:51,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091495637] [2020-12-23 09:29:51,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 09:29:51,866 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:51,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 09:29:51,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:29:51,867 INFO L87 Difference]: Start difference. First operand 6601 states and 8416 transitions. Second operand 13 states. [2020-12-23 09:29:56,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:29:56,015 INFO L93 Difference]: Finished difference Result 29573 states and 37442 transitions. [2020-12-23 09:29:56,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-12-23 09:29:56,016 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 359 [2020-12-23 09:29:56,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:29:56,046 INFO L225 Difference]: With dead ends: 29573 [2020-12-23 09:29:56,046 INFO L226 Difference]: Without dead ends: 23141 [2020-12-23 09:29:56,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 381 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=315, Invalid=2655, Unknown=0, NotChecked=0, Total=2970 [2020-12-23 09:29:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23141 states. [2020-12-23 09:29:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23141 to 8011. [2020-12-23 09:29:56,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8011 states. [2020-12-23 09:29:56,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8011 states to 8011 states and 10222 transitions. [2020-12-23 09:29:56,829 INFO L78 Accepts]: Start accepts. Automaton has 8011 states and 10222 transitions. Word has length 359 [2020-12-23 09:29:56,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:29:56,830 INFO L481 AbstractCegarLoop]: Abstraction has 8011 states and 10222 transitions. [2020-12-23 09:29:56,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 09:29:56,830 INFO L276 IsEmpty]: Start isEmpty. Operand 8011 states and 10222 transitions. [2020-12-23 09:29:56,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2020-12-23 09:29:56,833 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:29:56,834 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, 1] [2020-12-23 09:29:57,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:29:57,047 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]=== [2020-12-23 09:29:57,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:29:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash -832045976, now seen corresponding path program 1 times [2020-12-23 09:29:57,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:29:57,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083447578] [2020-12-23 09:29:57,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:29:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:57,745 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 20 proven. 812 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 09:29:57,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083447578] [2020-12-23 09:29:57,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759136785] [2020-12-23 09:29:57,746 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 [2020-12-23 09:29:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:29:58,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 09:29:58,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:29:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 20 proven. 812 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 09:29:58,957 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:29:58,957 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2020-12-23 09:29:58,957 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722308969] [2020-12-23 09:29:58,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 09:29:58,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:29:58,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 09:29:58,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:29:58,961 INFO L87 Difference]: Start difference. First operand 8011 states and 10222 transitions. Second operand 15 states. [2020-12-23 09:30:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:04,850 INFO L93 Difference]: Finished difference Result 35213 states and 44533 transitions. [2020-12-23 09:30:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2020-12-23 09:30:04,850 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 459 [2020-12-23 09:30:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:04,882 INFO L225 Difference]: With dead ends: 35213 [2020-12-23 09:30:04,882 INFO L226 Difference]: Without dead ends: 27371 [2020-12-23 09:30:04,891 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 485 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=369, Invalid=3921, Unknown=0, NotChecked=0, Total=4290 [2020-12-23 09:30:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27371 states. [2020-12-23 09:30:06,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27371 to 9423. [2020-12-23 09:30:06,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9423 states. [2020-12-23 09:30:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9423 states to 9423 states and 12030 transitions. [2020-12-23 09:30:06,083 INFO L78 Accepts]: Start accepts. Automaton has 9423 states and 12030 transitions. Word has length 459 [2020-12-23 09:30:06,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:06,084 INFO L481 AbstractCegarLoop]: Abstraction has 9423 states and 12030 transitions. [2020-12-23 09:30:06,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 09:30:06,085 INFO L276 IsEmpty]: Start isEmpty. Operand 9423 states and 12030 transitions. [2020-12-23 09:30:06,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2020-12-23 09:30:06,089 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:06,089 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2020-12-23 09:30:06,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-23 09:30:06,291 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]=== [2020-12-23 09:30:06,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1426740585, now seen corresponding path program 1 times [2020-12-23 09:30:06,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:06,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596441726] [2020-12-23 09:30:06,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 912 proven. 398 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-23 09:30:06,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596441726] [2020-12-23 09:30:06,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353890133] [2020-12-23 09:30:06,806 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 [2020-12-23 09:30:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:07,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 1597 conjuncts, 17 conjunts are in the unsatisfiable core [2020-12-23 09:30:07,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:07,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 1310 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-23 09:30:07,944 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-23 09:30:07,944 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2020-12-23 09:30:07,944 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30081634] [2020-12-23 09:30:07,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 09:30:07,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:07,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 09:30:07,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:30:07,946 INFO L87 Difference]: Start difference. First operand 9423 states and 12030 transitions. Second operand 13 states. [2020-12-23 09:30:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:10,326 INFO L93 Difference]: Finished difference Result 22059 states and 28008 transitions. [2020-12-23 09:30:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 09:30:10,327 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 560 [2020-12-23 09:30:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:10,346 INFO L225 Difference]: With dead ends: 22059 [2020-12-23 09:30:10,346 INFO L226 Difference]: Without dead ends: 12802 [2020-12-23 09:30:10,357 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=297, Invalid=695, Unknown=0, NotChecked=0, Total=992 [2020-12-23 09:30:10,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12802 states. [2020-12-23 09:30:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12802 to 9293. [2020-12-23 09:30:11,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9293 states. [2020-12-23 09:30:11,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9293 states to 9293 states and 11855 transitions. [2020-12-23 09:30:11,406 INFO L78 Accepts]: Start accepts. Automaton has 9293 states and 11855 transitions. Word has length 560 [2020-12-23 09:30:11,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:11,407 INFO L481 AbstractCegarLoop]: Abstraction has 9293 states and 11855 transitions. [2020-12-23 09:30:11,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 09:30:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 9293 states and 11855 transitions. [2020-12-23 09:30:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2020-12-23 09:30:11,413 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:11,413 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 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, 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, 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, 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] [2020-12-23 09:30:11,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:11,626 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]=== [2020-12-23 09:30:11,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:11,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1627083542, now seen corresponding path program 1 times [2020-12-23 09:30:11,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:11,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333769158] [2020-12-23 09:30:11,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2020-12-23 09:30:12,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333769158] [2020-12-23 09:30:12,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:12,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:30:12,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523468932] [2020-12-23 09:30:12,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:30:12,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:12,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:30:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:30:12,162 INFO L87 Difference]: Start difference. First operand 9293 states and 11855 transitions. Second operand 3 states. [2020-12-23 09:30:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:12,537 INFO L93 Difference]: Finished difference Result 11318 states and 14188 transitions. [2020-12-23 09:30:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:30:12,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 561 [2020-12-23 09:30:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:12,540 INFO L225 Difference]: With dead ends: 11318 [2020-12-23 09:30:12,540 INFO L226 Difference]: Without dead ends: 2080 [2020-12-23 09:30:12,545 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 [2020-12-23 09:30:12,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2020-12-23 09:30:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2077. [2020-12-23 09:30:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2077 states. [2020-12-23 09:30:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2077 states to 2077 states and 2303 transitions. [2020-12-23 09:30:12,755 INFO L78 Accepts]: Start accepts. Automaton has 2077 states and 2303 transitions. Word has length 561 [2020-12-23 09:30:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:12,756 INFO L481 AbstractCegarLoop]: Abstraction has 2077 states and 2303 transitions. [2020-12-23 09:30:12,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:30:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 2077 states and 2303 transitions. [2020-12-23 09:30:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2020-12-23 09:30:12,762 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:12,763 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 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, 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, 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, 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, 1, 1] [2020-12-23 09:30:12,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:30:12,763 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]=== [2020-12-23 09:30:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:12,764 INFO L82 PathProgramCache]: Analyzing trace with hash -312768950, now seen corresponding path program 1 times [2020-12-23 09:30:12,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:12,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508390718] [2020-12-23 09:30:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2020-12-23 09:30:13,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508390718] [2020-12-23 09:30:13,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:13,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-23 09:30:13,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881021727] [2020-12-23 09:30:13,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-23 09:30:13,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:13,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-23 09:30:13,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:30:13,092 INFO L87 Difference]: Start difference. First operand 2077 states and 2303 transitions. Second operand 7 states. [2020-12-23 09:30:13,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:13,660 INFO L93 Difference]: Finished difference Result 4252 states and 4754 transitions. [2020-12-23 09:30:13,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-23 09:30:13,660 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 562 [2020-12-23 09:30:13,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:13,664 INFO L225 Difference]: With dead ends: 4252 [2020-12-23 09:30:13,664 INFO L226 Difference]: Without dead ends: 3328 [2020-12-23 09:30:13,665 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 [2020-12-23 09:30:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2020-12-23 09:30:13,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 2069. [2020-12-23 09:30:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2069 states. [2020-12-23 09:30:13,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2285 transitions. [2020-12-23 09:30:13,882 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2285 transitions. Word has length 562 [2020-12-23 09:30:13,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:13,883 INFO L481 AbstractCegarLoop]: Abstraction has 2069 states and 2285 transitions. [2020-12-23 09:30:13,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-23 09:30:13,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2285 transitions. [2020-12-23 09:30:13,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2020-12-23 09:30:13,888 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:13,888 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 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, 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, 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, 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] [2020-12-23 09:30:13,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:30:13,888 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]=== [2020-12-23 09:30:13,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:13,889 INFO L82 PathProgramCache]: Analyzing trace with hash -37977565, now seen corresponding path program 1 times [2020-12-23 09:30:13,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:13,889 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024498032] [2020-12-23 09:30:13,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1218 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2020-12-23 09:30:14,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024498032] [2020-12-23 09:30:14,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:30:14,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:30:14,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351255499] [2020-12-23 09:30:14,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:30:14,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:14,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:30:14,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:30:14,258 INFO L87 Difference]: Start difference. First operand 2069 states and 2285 transitions. Second operand 5 states. [2020-12-23 09:30:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:14,661 INFO L93 Difference]: Finished difference Result 3542 states and 3942 transitions. [2020-12-23 09:30:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:30:14,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 563 [2020-12-23 09:30:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:14,664 INFO L225 Difference]: With dead ends: 3542 [2020-12-23 09:30:14,665 INFO L226 Difference]: Without dead ends: 2616 [2020-12-23 09:30:14,666 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 [2020-12-23 09:30:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2020-12-23 09:30:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 1997. [2020-12-23 09:30:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2020-12-23 09:30:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2144 transitions. [2020-12-23 09:30:14,920 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2144 transitions. Word has length 563 [2020-12-23 09:30:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:14,921 INFO L481 AbstractCegarLoop]: Abstraction has 1997 states and 2144 transitions. [2020-12-23 09:30:14,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:30:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2144 transitions. [2020-12-23 09:30:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2020-12-23 09:30:14,926 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:14,927 INFO L422 BasicCegarLoop]: trace histogram [12, 10, 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, 6, 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, 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, 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, 1] [2020-12-23 09:30:14,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:30:14,927 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]=== [2020-12-23 09:30:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:14,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1142183535, now seen corresponding path program 1 times [2020-12-23 09:30:14,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:14,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518513969] [2020-12-23 09:30:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 118 proven. 393 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2020-12-23 09:30:15,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518513969] [2020-12-23 09:30:15,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042695915] [2020-12-23 09:30:15,988 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 [2020-12-23 09:30:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:16,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 1732 conjuncts, 33 conjunts are in the unsatisfiable core [2020-12-23 09:30:16,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1327 backedges. 120 proven. 323 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2020-12-23 09:30:17,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:17,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2020-12-23 09:30:17,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022739043] [2020-12-23 09:30:17,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-12-23 09:30:17,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:17,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-12-23 09:30:17,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2020-12-23 09:30:17,336 INFO L87 Difference]: Start difference. First operand 1997 states and 2144 transitions. Second operand 21 states. [2020-12-23 09:30:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:18,629 INFO L93 Difference]: Finished difference Result 2311 states and 2482 transitions. [2020-12-23 09:30:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-12-23 09:30:18,630 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 618 [2020-12-23 09:30:18,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:18,633 INFO L225 Difference]: With dead ends: 2311 [2020-12-23 09:30:18,633 INFO L226 Difference]: Without dead ends: 2309 [2020-12-23 09:30:18,635 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 623 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=1513, Unknown=0, NotChecked=0, Total=1806 [2020-12-23 09:30:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2309 states. [2020-12-23 09:30:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2309 to 1997. [2020-12-23 09:30:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2020-12-23 09:30:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2143 transitions. [2020-12-23 09:30:18,871 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2143 transitions. Word has length 618 [2020-12-23 09:30:18,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:18,871 INFO L481 AbstractCegarLoop]: Abstraction has 1997 states and 2143 transitions. [2020-12-23 09:30:18,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-12-23 09:30:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2143 transitions. [2020-12-23 09:30:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2020-12-23 09:30:18,877 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:18,878 INFO L422 BasicCegarLoop]: trace histogram [13, 10, 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, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1] [2020-12-23 09:30:19,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2020-12-23 09:30:19,094 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]=== [2020-12-23 09:30:19,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:19,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1804738143, now seen corresponding path program 1 times [2020-12-23 09:30:19,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:19,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240251675] [2020-12-23 09:30:19,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:19,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 337 proven. 47 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2020-12-23 09:30:19,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240251675] [2020-12-23 09:30:19,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964988708] [2020-12-23 09:30:19,755 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 [2020-12-23 09:30:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:20,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 1860 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-23 09:30:20,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:20,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 337 proven. 47 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2020-12-23 09:30:20,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:20,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-12-23 09:30:20,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928724265] [2020-12-23 09:30:20,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:30:20,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:20,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:30:20,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:30:20,889 INFO L87 Difference]: Start difference. First operand 1997 states and 2143 transitions. Second operand 9 states. [2020-12-23 09:30:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:21,543 INFO L93 Difference]: Finished difference Result 3367 states and 3619 transitions. [2020-12-23 09:30:21,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-23 09:30:21,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 667 [2020-12-23 09:30:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:21,546 INFO L225 Difference]: With dead ends: 3367 [2020-12-23 09:30:21,546 INFO L226 Difference]: Without dead ends: 2692 [2020-12-23 09:30:21,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 675 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:30:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2692 states. [2020-12-23 09:30:21,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2692 to 1991. [2020-12-23 09:30:21,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2020-12-23 09:30:21,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2127 transitions. [2020-12-23 09:30:21,818 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2127 transitions. Word has length 667 [2020-12-23 09:30:21,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:21,819 INFO L481 AbstractCegarLoop]: Abstraction has 1991 states and 2127 transitions. [2020-12-23 09:30:21,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:30:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2127 transitions. [2020-12-23 09:30:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2020-12-23 09:30:21,823 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:21,823 INFO L422 BasicCegarLoop]: trace histogram [14, 10, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1] [2020-12-23 09:30:22,032 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2020-12-23 09:30:22,033 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]=== [2020-12-23 09:30:22,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1673506766, now seen corresponding path program 1 times [2020-12-23 09:30:22,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:22,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139017262] [2020-12-23 09:30:22,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1673 backedges. 223 proven. 987 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2020-12-23 09:30:23,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139017262] [2020-12-23 09:30:23,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425002641] [2020-12-23 09:30:23,287 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 [2020-12-23 09:30:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:23,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 1999 conjuncts, 45 conjunts are in the unsatisfiable core [2020-12-23 09:30:23,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1673 backedges. 307 proven. 849 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2020-12-23 09:30:25,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:25,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 32 [2020-12-23 09:30:25,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195870024] [2020-12-23 09:30:25,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 32 states [2020-12-23 09:30:25,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:25,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2020-12-23 09:30:25,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2020-12-23 09:30:25,261 INFO L87 Difference]: Start difference. First operand 1991 states and 2127 transitions. Second operand 32 states. [2020-12-23 09:30:26,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:26,970 INFO L93 Difference]: Finished difference Result 2237 states and 2390 transitions. [2020-12-23 09:30:26,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-12-23 09:30:26,970 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 724 [2020-12-23 09:30:26,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:26,972 INFO L225 Difference]: With dead ends: 2237 [2020-12-23 09:30:26,972 INFO L226 Difference]: Without dead ends: 2235 [2020-12-23 09:30:26,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 788 GetRequests, 726 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=435, Invalid=3347, Unknown=0, NotChecked=0, Total=3782 [2020-12-23 09:30:26,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2235 states. [2020-12-23 09:30:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2235 to 1991. [2020-12-23 09:30:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2020-12-23 09:30:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2126 transitions. [2020-12-23 09:30:27,210 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2126 transitions. Word has length 724 [2020-12-23 09:30:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:27,211 INFO L481 AbstractCegarLoop]: Abstraction has 1991 states and 2126 transitions. [2020-12-23 09:30:27,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2020-12-23 09:30:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2126 transitions. [2020-12-23 09:30:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 774 [2020-12-23 09:30:27,216 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:27,217 INFO L422 BasicCegarLoop]: trace histogram [15, 10, 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, 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, 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, 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, 1, 1] [2020-12-23 09:30:27,430 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:27,431 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]=== [2020-12-23 09:30:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:27,432 INFO L82 PathProgramCache]: Analyzing trace with hash -187150814, now seen corresponding path program 1 times [2020-12-23 09:30:27,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:27,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662364088] [2020-12-23 09:30:27,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:28,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 568 proven. 208 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2020-12-23 09:30:28,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662364088] [2020-12-23 09:30:28,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94770948] [2020-12-23 09:30:28,150 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 [2020-12-23 09:30:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:28,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 2127 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-23 09:30:28,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1876 backedges. 568 proven. 208 refuted. 0 times theorem prover too weak. 1100 trivial. 0 not checked. [2020-12-23 09:30:29,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:29,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-12-23 09:30:29,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880842984] [2020-12-23 09:30:29,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-23 09:30:29,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:29,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-23 09:30:29,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-12-23 09:30:29,539 INFO L87 Difference]: Start difference. First operand 1991 states and 2126 transitions. Second operand 11 states. [2020-12-23 09:30:30,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:30,419 INFO L93 Difference]: Finished difference Result 3003 states and 3216 transitions. [2020-12-23 09:30:30,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 09:30:30,419 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 773 [2020-12-23 09:30:30,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:30,422 INFO L225 Difference]: With dead ends: 3003 [2020-12-23 09:30:30,423 INFO L226 Difference]: Without dead ends: 2519 [2020-12-23 09:30:30,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 807 GetRequests, 784 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2020-12-23 09:30:30,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2519 states. [2020-12-23 09:30:30,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2519 to 1987. [2020-12-23 09:30:30,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2020-12-23 09:30:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2112 transitions. [2020-12-23 09:30:30,667 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2112 transitions. Word has length 773 [2020-12-23 09:30:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:30,667 INFO L481 AbstractCegarLoop]: Abstraction has 1987 states and 2112 transitions. [2020-12-23 09:30:30,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-23 09:30:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2112 transitions. [2020-12-23 09:30:30,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2020-12-23 09:30:30,672 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:30,673 INFO L422 BasicCegarLoop]: trace histogram [16, 10, 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, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 1] [2020-12-23 09:30:30,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2020-12-23 09:30:30,877 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]=== [2020-12-23 09:30:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1604741410, now seen corresponding path program 1 times [2020-12-23 09:30:30,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:30,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153552733] [2020-12-23 09:30:30,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:32,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2133 backedges. 182 proven. 1738 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2020-12-23 09:30:32,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153552733] [2020-12-23 09:30:32,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127312590] [2020-12-23 09:30:32,623 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 [2020-12-23 09:30:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:33,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 2267 conjuncts, 57 conjunts are in the unsatisfiable core [2020-12-23 09:30:33,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2133 backedges. 406 proven. 1478 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2020-12-23 09:30:35,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:35,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 38 [2020-12-23 09:30:35,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74073232] [2020-12-23 09:30:35,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 38 states [2020-12-23 09:30:35,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:35,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2020-12-23 09:30:35,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1306, Unknown=0, NotChecked=0, Total=1406 [2020-12-23 09:30:35,282 INFO L87 Difference]: Start difference. First operand 1987 states and 2112 transitions. Second operand 38 states. [2020-12-23 09:30:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:37,610 INFO L93 Difference]: Finished difference Result 2243 states and 2385 transitions. [2020-12-23 09:30:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-12-23 09:30:37,611 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 831 [2020-12-23 09:30:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:37,614 INFO L225 Difference]: With dead ends: 2243 [2020-12-23 09:30:37,614 INFO L226 Difference]: Without dead ends: 2241 [2020-12-23 09:30:37,616 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 909 GetRequests, 835 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1233 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=507, Invalid=4895, Unknown=0, NotChecked=0, Total=5402 [2020-12-23 09:30:37,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2020-12-23 09:30:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 1987. [2020-12-23 09:30:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2020-12-23 09:30:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2111 transitions. [2020-12-23 09:30:37,894 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2111 transitions. Word has length 831 [2020-12-23 09:30:37,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:37,895 INFO L481 AbstractCegarLoop]: Abstraction has 1987 states and 2111 transitions. [2020-12-23 09:30:37,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2020-12-23 09:30:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2111 transitions. [2020-12-23 09:30:37,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2020-12-23 09:30:37,901 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:37,901 INFO L422 BasicCegarLoop]: trace histogram [17, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 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, 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, 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, 1, 1] [2020-12-23 09:30:38,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:38,102 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]=== [2020-12-23 09:30:38,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:38,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2120824654, now seen corresponding path program 1 times [2020-12-23 09:30:38,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:38,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329086611] [2020-12-23 09:30:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:38,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 799 proven. 484 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2020-12-23 09:30:39,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329086611] [2020-12-23 09:30:39,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445653789] [2020-12-23 09:30:39,086 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 [2020-12-23 09:30:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:39,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 2395 conjuncts, 31 conjunts are in the unsatisfiable core [2020-12-23 09:30:39,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2387 backedges. 799 proven. 484 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2020-12-23 09:30:40,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:40,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2020-12-23 09:30:40,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301233547] [2020-12-23 09:30:40,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 09:30:40,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:40,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 09:30:40,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:30:40,930 INFO L87 Difference]: Start difference. First operand 1987 states and 2111 transitions. Second operand 13 states. [2020-12-23 09:30:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:42,022 INFO L93 Difference]: Finished difference Result 2641 states and 2815 transitions. [2020-12-23 09:30:42,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-12-23 09:30:42,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 880 [2020-12-23 09:30:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:42,025 INFO L225 Difference]: With dead ends: 2641 [2020-12-23 09:30:42,025 INFO L226 Difference]: Without dead ends: 2348 [2020-12-23 09:30:42,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 894 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2020-12-23 09:30:42,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2348 states. [2020-12-23 09:30:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2348 to 1985. [2020-12-23 09:30:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2020-12-23 09:30:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2099 transitions. [2020-12-23 09:30:42,279 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2099 transitions. Word has length 880 [2020-12-23 09:30:42,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:42,280 INFO L481 AbstractCegarLoop]: Abstraction has 1985 states and 2099 transitions. [2020-12-23 09:30:42,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 09:30:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2099 transitions. [2020-12-23 09:30:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 940 [2020-12-23 09:30:42,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:42,286 INFO L422 BasicCegarLoop]: trace histogram [18, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 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, 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, 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, 1] [2020-12-23 09:30:42,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2020-12-23 09:30:42,488 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:42,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:42,489 INFO L82 PathProgramCache]: Analyzing trace with hash 957864572, now seen corresponding path program 1 times [2020-12-23 09:30:42,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:42,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164815888] [2020-12-23 09:30:42,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2708 backedges. 141 proven. 2498 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2020-12-23 09:30:44,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164815888] [2020-12-23 09:30:44,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037546342] [2020-12-23 09:30:44,679 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:45,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 2536 conjuncts, 69 conjunts are in the unsatisfiable core [2020-12-23 09:30:45,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2708 backedges. 413 proven. 2208 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-12-23 09:30:47,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:47,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 44 [2020-12-23 09:30:47,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214940965] [2020-12-23 09:30:47,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 44 states [2020-12-23 09:30:47,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:47,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2020-12-23 09:30:47,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1774, Unknown=0, NotChecked=0, Total=1892 [2020-12-23 09:30:47,941 INFO L87 Difference]: Start difference. First operand 1985 states and 2099 transitions. Second operand 44 states. [2020-12-23 09:30:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:51,184 INFO L93 Difference]: Finished difference Result 2251 states and 2382 transitions. [2020-12-23 09:30:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2020-12-23 09:30:51,185 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 939 [2020-12-23 09:30:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:51,189 INFO L225 Difference]: With dead ends: 2251 [2020-12-23 09:30:51,189 INFO L226 Difference]: Without dead ends: 2249 [2020-12-23 09:30:51,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1030 GetRequests, 945 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=568, Invalid=6572, Unknown=0, NotChecked=0, Total=7140 [2020-12-23 09:30:51,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2020-12-23 09:30:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 1985. [2020-12-23 09:30:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2020-12-23 09:30:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2098 transitions. [2020-12-23 09:30:51,464 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2098 transitions. Word has length 939 [2020-12-23 09:30:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:51,465 INFO L481 AbstractCegarLoop]: Abstraction has 1985 states and 2098 transitions. [2020-12-23 09:30:51,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2020-12-23 09:30:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2098 transitions. [2020-12-23 09:30:51,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2020-12-23 09:30:51,472 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:51,473 INFO L422 BasicCegarLoop]: trace histogram [19, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 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, 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, 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] [2020-12-23 09:30:51,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:51,674 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:51,675 INFO L82 PathProgramCache]: Analyzing trace with hash -250589900, now seen corresponding path program 1 times [2020-12-23 09:30:51,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:51,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916372531] [2020-12-23 09:30:51,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 1030 proven. 876 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2020-12-23 09:30:53,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916372531] [2020-12-23 09:30:53,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853500104] [2020-12-23 09:30:53,178 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:30:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:30:53,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 2664 conjuncts, 37 conjunts are in the unsatisfiable core [2020-12-23 09:30:53,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:30:55,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3014 backedges. 1030 proven. 876 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2020-12-23 09:30:55,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:30:55,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2020-12-23 09:30:55,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420462047] [2020-12-23 09:30:55,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-23 09:30:55,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:30:55,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-23 09:30:55,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:30:55,396 INFO L87 Difference]: Start difference. First operand 1985 states and 2098 transitions. Second operand 15 states. [2020-12-23 09:30:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:30:56,692 INFO L93 Difference]: Finished difference Result 2356 states and 2500 transitions. [2020-12-23 09:30:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-23 09:30:56,692 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 988 [2020-12-23 09:30:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:30:56,695 INFO L225 Difference]: With dead ends: 2356 [2020-12-23 09:30:56,695 INFO L226 Difference]: Without dead ends: 2254 [2020-12-23 09:30:56,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 1004 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2020-12-23 09:30:56,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2020-12-23 09:30:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 1983. [2020-12-23 09:30:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1983 states. [2020-12-23 09:30:56,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1983 states to 1983 states and 2087 transitions. [2020-12-23 09:30:56,955 INFO L78 Accepts]: Start accepts. Automaton has 1983 states and 2087 transitions. Word has length 988 [2020-12-23 09:30:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:30:56,956 INFO L481 AbstractCegarLoop]: Abstraction has 1983 states and 2087 transitions. [2020-12-23 09:30:56,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-23 09:30:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1983 states and 2087 transitions. [2020-12-23 09:30:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1049 [2020-12-23 09:30:56,963 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:30:56,964 INFO L422 BasicCegarLoop]: trace histogram [20, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 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, 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, 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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2020-12-23 09:30:57,178 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2020-12-23 09:30:57,179 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:30:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:30:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash 198975503, now seen corresponding path program 1 times [2020-12-23 09:30:57,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:30:57,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369169279] [2020-12-23 09:30:57,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:30:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3399 backedges. 100 proven. 3266 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 09:31:00,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369169279] [2020-12-23 09:31:00,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893883599] [2020-12-23 09:31:00,205 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:31:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:00,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 2806 conjuncts, 81 conjunts are in the unsatisfiable core [2020-12-23 09:31:00,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:31:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3399 backedges. 328 proven. 3038 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-12-23 09:31:04,317 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:31:04,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 50 [2020-12-23 09:31:04,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816148650] [2020-12-23 09:31:04,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-12-23 09:31:04,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:04,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-12-23 09:31:04,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2314, Unknown=0, NotChecked=0, Total=2450 [2020-12-23 09:31:04,320 INFO L87 Difference]: Start difference. First operand 1983 states and 2087 transitions. Second operand 50 states. [2020-12-23 09:31:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:09,234 INFO L93 Difference]: Finished difference Result 2254 states and 2376 transitions. [2020-12-23 09:31:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2020-12-23 09:31:09,235 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1048 [2020-12-23 09:31:09,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:09,236 INFO L225 Difference]: With dead ends: 2254 [2020-12-23 09:31:09,236 INFO L226 Difference]: Without dead ends: 0 [2020-12-23 09:31:09,239 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1166 GetRequests, 1062 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2549 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=760, Invalid=9952, Unknown=0, NotChecked=0, Total=10712 [2020-12-23 09:31:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-23 09:31:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-23 09:31:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-23 09:31:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-23 09:31:09,240 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1048 [2020-12-23 09:31:09,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:09,240 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-23 09:31:09,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2020-12-23 09:31:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-23 09:31:09,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-23 09:31:09,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2020-12-23 09:31:09,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-23 09:31:13,990 WARN L197 SmtUtils]: Spent 4.52 s on a formula simplification. DAG size of input: 860 DAG size of output: 686 [2020-12-23 09:31:17,137 WARN L197 SmtUtils]: Spent 3.14 s on a formula simplification. DAG size of input: 860 DAG size of output: 686 [2020-12-23 09:31:18,339 WARN L197 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 721 DAG size of output: 613 [2020-12-23 09:31:26,421 WARN L197 SmtUtils]: Spent 8.07 s on a formula simplification. DAG size of input: 1648 DAG size of output: 1331 [2020-12-23 09:31:26,545 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 213 [2020-12-23 09:31:27,647 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 721 DAG size of output: 613 [2020-12-23 09:31:28,636 WARN L197 SmtUtils]: Spent 985.00 ms on a formula simplification. DAG size of input: 698 DAG size of output: 566 [2020-12-23 09:31:31,656 WARN L197 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 830 DAG size of output: 662 [2020-12-23 09:31:31,898 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 246 [2020-12-23 09:31:34,848 WARN L197 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 860 DAG size of output: 686 [2020-12-23 09:31:35,069 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 246 [2020-12-23 09:31:35,362 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 313 DAG size of output: 253 [2020-12-23 09:31:35,575 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 282 DAG size of output: 247 [2020-12-23 09:31:38,434 WARN L197 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 842 DAG size of output: 711 [2020-12-23 09:31:38,648 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 246 [2020-12-23 09:31:38,779 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 216 [2020-12-23 09:31:41,645 WARN L197 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 842 DAG size of output: 711 [2020-12-23 09:31:41,763 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 213 [2020-12-23 09:31:42,832 WARN L197 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 721 DAG size of output: 613 [2020-12-23 09:31:42,943 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 202 [2020-12-23 09:31:43,927 WARN L197 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 698 DAG size of output: 591 [2020-12-23 09:31:44,049 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 213 [2020-12-23 09:31:44,306 WARN L197 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 323 DAG size of output: 214 [2020-12-23 09:31:45,362 WARN L197 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 721 DAG size of output: 613 [2020-12-23 09:31:45,663 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 287 [2020-12-23 09:31:45,876 WARN L197 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 246 [2020-12-23 09:31:50,016 WARN L197 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 909 DAG size of output: 763 [2020-12-23 09:31:50,372 WARN L197 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 265 [2020-12-23 09:31:50,715 WARN L197 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 306 DAG size of output: 265 [2020-12-23 09:31:50,953 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 265 DAG size of output: 232 [2020-12-23 09:31:53,798 WARN L197 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 842 DAG size of output: 711 [2020-12-23 09:31:53,909 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 215 [2020-12-23 09:31:54,111 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 243 [2020-12-23 09:31:57,004 WARN L197 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 842 DAG size of output: 711 [2020-12-23 09:31:57,113 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 215 [2020-12-23 09:31:58,363 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 737 DAG size of output: 635 [2020-12-23 09:31:58,481 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 213 [2020-12-23 09:31:59,538 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 721 DAG size of output: 613 [2020-12-23 09:31:59,659 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 213 [2020-12-23 09:32:00,619 WARN L197 SmtUtils]: Spent 893.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 159 [2020-12-23 09:32:01,032 WARN L197 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 332 DAG size of output: 291 [2020-12-23 09:32:01,320 WARN L197 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 249 [2020-12-23 09:32:12,133 WARN L197 SmtUtils]: Spent 10.81 s on a formula simplification. DAG size of input: 1962 DAG size of output: 1597 [2020-12-23 09:32:16,011 WARN L197 SmtUtils]: Spent 3.80 s on a formula simplification. DAG size of input: 965 DAG size of output: 724 [2020-12-23 09:32:18,905 WARN L197 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 842 DAG size of output: 711 [2020-12-23 09:32:19,014 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 215 [2020-12-23 09:32:19,289 WARN L197 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 249 [2020-12-23 09:32:19,451 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 213 [2020-12-23 09:32:19,561 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 215 [2020-12-23 09:32:19,841 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 249 [2020-12-23 09:32:20,442 WARN L197 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 436 DAG size of output: 359 [2020-12-23 09:32:20,648 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 248 [2020-12-23 09:32:20,861 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 253 [2020-12-23 09:32:22,134 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 454 DAG size of output: 401 [2020-12-23 09:32:25,058 WARN L197 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 842 DAG size of output: 711 [2020-12-23 09:32:25,825 WARN L197 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 453 DAG size of output: 410 [2020-12-23 09:32:28,476 WARN L197 SmtUtils]: Spent 2.65 s on a formula simplification. DAG size of input: 704 DAG size of output: 607 [2020-12-23 09:32:28,600 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 215 [2020-12-23 09:32:31,619 WARN L197 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 860 DAG size of output: 686 [2020-12-23 09:32:31,728 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 215 [2020-12-23 09:32:31,848 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 189 [2020-12-23 09:32:31,992 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 263 DAG size of output: 219 [2020-12-23 09:32:34,935 WARN L197 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 860 DAG size of output: 686 [2020-12-23 09:32:35,130 WARN L197 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 277 DAG size of output: 229 [2020-12-23 09:32:35,346 WARN L197 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 310 DAG size of output: 276 [2020-12-23 09:32:38,404 WARN L197 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 874 DAG size of output: 714 [2020-12-23 09:32:39,450 WARN L197 SmtUtils]: Spent 944.00 ms on a formula simplification. DAG size of input: 557 DAG size of output: 467 [2020-12-23 09:32:40,224 WARN L197 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 447 DAG size of output: 404 [2020-12-23 09:32:50,640 WARN L197 SmtUtils]: Spent 10.27 s on a formula simplification. DAG size of input: 646 DAG size of output: 203 [2020-12-23 09:33:00,917 WARN L197 SmtUtils]: Spent 10.27 s on a formula simplification. DAG size of input: 646 DAG size of output: 203 [2020-12-23 09:33:01,049 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-12-23 09:33:01,184 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2020-12-23 09:33:01,524 WARN L197 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 39 [2020-12-23 09:33:08,907 WARN L197 SmtUtils]: Spent 7.37 s on a formula simplification. DAG size of input: 560 DAG size of output: 186