/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/transmitter.12.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:37:42,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:37:42,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:37:43,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:37:43,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:37:43,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:37:43,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:37:43,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:37:43,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:37:43,014 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:37:43,015 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:37:43,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:37:43,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:37:43,019 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:37:43,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:37:43,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:37:43,023 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:37:43,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:37:43,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:37:43,029 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:37:43,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:37:43,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:37:43,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:37:43,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:37:43,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:37:43,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:37:43,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:37:43,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:37:43,042 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:37:43,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:37:43,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:37:43,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:37:43,045 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:37:43,047 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:37:43,048 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:37:43,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:37:43,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:37:43,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:37:43,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:37:43,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:37:43,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:37:43,054 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:37:43,090 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:37:43,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:37:43,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:37:43,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:37:43,095 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:37:43,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:37:43,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:37:43,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:37:43,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:37:43,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:37:43,098 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:37:43,098 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:37:43,098 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:37:43,099 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:37:43,099 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:37:43,099 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:37:43,099 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:37:43,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:37:43,100 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:37:43,100 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:37:43,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:37:43,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:37:43,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:37:43,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:37:43,102 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:37:43,102 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:37:43,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:37:43,584 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:37:43,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:37:43,589 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:37:43,590 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:37:43,592 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.12.cil.c [2020-12-23 09:37:43,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c546edaa5/f24bc14fad684609831fe3f88fa64f21/FLAG54ad7a44b [2020-12-23 09:37:44,323 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:37:44,324 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.12.cil.c [2020-12-23 09:37:44,342 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c546edaa5/f24bc14fad684609831fe3f88fa64f21/FLAG54ad7a44b [2020-12-23 09:37:44,626 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c546edaa5/f24bc14fad684609831fe3f88fa64f21 [2020-12-23 09:37:44,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:37:44,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:37:44,638 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:37:44,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:37:44,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:37:44,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:37:44" (1/1) ... [2020-12-23 09:37:44,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b4ee9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:44, skipping insertion in model container [2020-12-23 09:37:44,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:37:44" (1/1) ... [2020-12-23 09:37:44,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:37:44,753 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:37:44,943 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/transmitter.12.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~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[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] [2020-12-23 09:37:45,165 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:37:45,187 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:37:45,200 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/transmitter.12.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~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[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] [2020-12-23 09:37:45,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:37:45,413 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:37:45,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:45 WrapperNode [2020-12-23 09:37:45,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:37:45,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:37:45,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:37:45,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:37:45,426 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:37:45" (1/1) ... [2020-12-23 09:37:45,442 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:37:45" (1/1) ... [2020-12-23 09:37:45,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:37:45,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:37:45,609 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:37:45,609 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:37:45,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:45" (1/1) ... [2020-12-23 09:37:45,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:45" (1/1) ... [2020-12-23 09:37:45,640 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:45" (1/1) ... [2020-12-23 09:37:45,641 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:45" (1/1) ... [2020-12-23 09:37:45,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:45" (1/1) ... [2020-12-23 09:37:45,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:45" (1/1) ... [2020-12-23 09:37:45,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:45" (1/1) ... [2020-12-23 09:37:45,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:37:45,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:37:45,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:37:45,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:37:45,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:45" (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:37:45,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:37:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:37:45,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:37:45,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:37:48,538 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:37:48,539 INFO L299 CfgBuilder]: Removed 524 assume(true) statements. [2020-12-23 09:37:48,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:37:48 BoogieIcfgContainer [2020-12-23 09:37:48,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:37:48,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:37:48,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:37:48,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:37:48,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:37:44" (1/3) ... [2020-12-23 09:37:48,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619332c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:37:48, skipping insertion in model container [2020-12-23 09:37:48,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:45" (2/3) ... [2020-12-23 09:37:48,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619332c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:37:48, skipping insertion in model container [2020-12-23 09:37:48,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:37:48" (3/3) ... [2020-12-23 09:37:48,553 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.12.cil.c [2020-12-23 09:37:48,560 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:37:48,566 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:37:48,586 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:37:48,623 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:37:48,623 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:37:48,623 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:37:48,623 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:37:48,624 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:37:48,624 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:37:48,624 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:37:48,624 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:37:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states. [2020-12-23 09:37:48,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:48,701 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:48,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:48,703 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash -166317093, now seen corresponding path program 1 times [2020-12-23 09:37:48,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:48,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047280503] [2020-12-23 09:37:48,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:49,182 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:37:49,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047280503] [2020-12-23 09:37:49,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:49,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:49,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446179746] [2020-12-23 09:37:49,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:49,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:49,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:49,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:49,217 INFO L87 Difference]: Start difference. First operand 1662 states. Second operand 3 states. [2020-12-23 09:37:49,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:49,418 INFO L93 Difference]: Finished difference Result 3319 states and 5015 transitions. [2020-12-23 09:37:49,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:49,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:37:49,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:49,464 INFO L225 Difference]: With dead ends: 3319 [2020-12-23 09:37:49,464 INFO L226 Difference]: Without dead ends: 1658 [2020-12-23 09:37:49,481 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:37:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2020-12-23 09:37:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2020-12-23 09:37:49,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2020-12-23 09:37:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2473 transitions. [2020-12-23 09:37:49,641 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2473 transitions. Word has length 169 [2020-12-23 09:37:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:49,642 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 2473 transitions. [2020-12-23 09:37:49,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2473 transitions. [2020-12-23 09:37:49,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:49,650 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:49,650 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:49,652 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:37:49,652 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:49,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1756933337, now seen corresponding path program 1 times [2020-12-23 09:37:49,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:49,653 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292214825] [2020-12-23 09:37:49,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:49,872 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:37:49,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292214825] [2020-12-23 09:37:49,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:49,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:49,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234001256] [2020-12-23 09:37:49,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:49,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:49,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:49,880 INFO L87 Difference]: Start difference. First operand 1658 states and 2473 transitions. Second operand 3 states. [2020-12-23 09:37:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:49,990 INFO L93 Difference]: Finished difference Result 3303 states and 4924 transitions. [2020-12-23 09:37:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:49,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:37:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:50,006 INFO L225 Difference]: With dead ends: 3303 [2020-12-23 09:37:50,006 INFO L226 Difference]: Without dead ends: 1658 [2020-12-23 09:37:50,012 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:37:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2020-12-23 09:37:50,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2020-12-23 09:37:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2020-12-23 09:37:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2472 transitions. [2020-12-23 09:37:50,139 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2472 transitions. Word has length 169 [2020-12-23 09:37:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:50,142 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 2472 transitions. [2020-12-23 09:37:50,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2472 transitions. [2020-12-23 09:37:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:50,149 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:50,149 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:50,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:37:50,150 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:50,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:50,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1412105175, now seen corresponding path program 1 times [2020-12-23 09:37:50,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:50,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715668426] [2020-12-23 09:37:50,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:50,386 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:37:50,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715668426] [2020-12-23 09:37:50,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:50,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:50,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437571986] [2020-12-23 09:37:50,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:50,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:50,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:50,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:50,390 INFO L87 Difference]: Start difference. First operand 1658 states and 2472 transitions. Second operand 3 states. [2020-12-23 09:37:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:50,604 INFO L93 Difference]: Finished difference Result 4708 states and 6998 transitions. [2020-12-23 09:37:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:50,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:37:50,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:50,623 INFO L225 Difference]: With dead ends: 4708 [2020-12-23 09:37:50,623 INFO L226 Difference]: Without dead ends: 3067 [2020-12-23 09:37:50,628 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:37:50,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2020-12-23 09:37:50,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3065. [2020-12-23 09:37:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:50,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4536 transitions. [2020-12-23 09:37:50,758 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4536 transitions. Word has length 169 [2020-12-23 09:37:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:50,759 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4536 transitions. [2020-12-23 09:37:50,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4536 transitions. [2020-12-23 09:37:50,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:50,762 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:50,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:50,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:37:50,764 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:50,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:50,764 INFO L82 PathProgramCache]: Analyzing trace with hash -474166761, now seen corresponding path program 1 times [2020-12-23 09:37:50,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:50,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009420206] [2020-12-23 09:37:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:50,952 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:37:50,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009420206] [2020-12-23 09:37:50,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:50,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:50,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154393209] [2020-12-23 09:37:50,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:50,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:50,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:50,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:50,959 INFO L87 Difference]: Start difference. First operand 3065 states and 4536 transitions. Second operand 4 states. [2020-12-23 09:37:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:51,279 INFO L93 Difference]: Finished difference Result 7520 states and 11108 transitions. [2020-12-23 09:37:51,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:51,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:37:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:51,304 INFO L225 Difference]: With dead ends: 7520 [2020-12-23 09:37:51,304 INFO L226 Difference]: Without dead ends: 4473 [2020-12-23 09:37:51,310 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2020-12-23 09:37:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 3065. [2020-12-23 09:37:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:51,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4533 transitions. [2020-12-23 09:37:51,509 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4533 transitions. Word has length 169 [2020-12-23 09:37:51,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:51,509 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4533 transitions. [2020-12-23 09:37:51,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4533 transitions. [2020-12-23 09:37:51,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:51,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:51,512 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:51,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:37:51,513 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:51,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1420167125, now seen corresponding path program 1 times [2020-12-23 09:37:51,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:51,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078421629] [2020-12-23 09:37:51,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:51,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:51,609 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:37:51,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078421629] [2020-12-23 09:37:51,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:51,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:51,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703755738] [2020-12-23 09:37:51,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:51,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:51,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:51,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:51,613 INFO L87 Difference]: Start difference. First operand 3065 states and 4533 transitions. Second operand 4 states. [2020-12-23 09:37:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:51,910 INFO L93 Difference]: Finished difference Result 7518 states and 11098 transitions. [2020-12-23 09:37:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:51,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:37:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:51,936 INFO L225 Difference]: With dead ends: 7518 [2020-12-23 09:37:51,936 INFO L226 Difference]: Without dead ends: 4472 [2020-12-23 09:37:51,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4472 states. [2020-12-23 09:37:52,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4472 to 3065. [2020-12-23 09:37:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:52,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4530 transitions. [2020-12-23 09:37:52,163 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4530 transitions. Word has length 169 [2020-12-23 09:37:52,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:52,164 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4530 transitions. [2020-12-23 09:37:52,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:52,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4530 transitions. [2020-12-23 09:37:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:52,167 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:52,168 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:52,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:37:52,168 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1428219305, now seen corresponding path program 1 times [2020-12-23 09:37:52,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:52,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691800555] [2020-12-23 09:37:52,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:52,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:52,274 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691800555] [2020-12-23 09:37:52,274 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:52,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:52,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129164019] [2020-12-23 09:37:52,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:52,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:52,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:52,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:52,277 INFO L87 Difference]: Start difference. First operand 3065 states and 4530 transitions. Second operand 4 states. [2020-12-23 09:37:52,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:52,745 INFO L93 Difference]: Finished difference Result 7516 states and 11088 transitions. [2020-12-23 09:37:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:52,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:37:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:52,774 INFO L225 Difference]: With dead ends: 7516 [2020-12-23 09:37:52,775 INFO L226 Difference]: Without dead ends: 4471 [2020-12-23 09:37:52,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:52,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2020-12-23 09:37:53,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 3065. [2020-12-23 09:37:53,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4527 transitions. [2020-12-23 09:37:53,051 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4527 transitions. Word has length 169 [2020-12-23 09:37:53,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:53,051 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4527 transitions. [2020-12-23 09:37:53,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:53,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4527 transitions. [2020-12-23 09:37:53,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:53,055 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:53,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:53,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:37:53,055 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:53,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:53,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1943580565, now seen corresponding path program 1 times [2020-12-23 09:37:53,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:53,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597994820] [2020-12-23 09:37:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:53,128 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:37:53,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597994820] [2020-12-23 09:37:53,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:53,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:53,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071062214] [2020-12-23 09:37:53,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:53,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:53,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:53,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:53,131 INFO L87 Difference]: Start difference. First operand 3065 states and 4527 transitions. Second operand 3 states. [2020-12-23 09:37:53,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:53,301 INFO L93 Difference]: Finished difference Result 6108 states and 9019 transitions. [2020-12-23 09:37:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:53,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:37:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:53,320 INFO L225 Difference]: With dead ends: 6108 [2020-12-23 09:37:53,321 INFO L226 Difference]: Without dead ends: 3065 [2020-12-23 09:37:53,328 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:37:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2020-12-23 09:37:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2020-12-23 09:37:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4519 transitions. [2020-12-23 09:37:53,505 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4519 transitions. Word has length 169 [2020-12-23 09:37:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:53,506 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4519 transitions. [2020-12-23 09:37:53,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4519 transitions. [2020-12-23 09:37:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:53,508 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:53,509 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:53,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:37:53,509 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:53,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:53,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1722547883, now seen corresponding path program 1 times [2020-12-23 09:37:53,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:53,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428653828] [2020-12-23 09:37:53,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:53,602 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:37:53,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428653828] [2020-12-23 09:37:53,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:53,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:53,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020746407] [2020-12-23 09:37:53,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:53,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:53,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:53,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:53,605 INFO L87 Difference]: Start difference. First operand 3065 states and 4519 transitions. Second operand 4 states. [2020-12-23 09:37:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:53,941 INFO L93 Difference]: Finished difference Result 7510 states and 11053 transitions. [2020-12-23 09:37:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:53,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:37:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:53,965 INFO L225 Difference]: With dead ends: 7510 [2020-12-23 09:37:53,965 INFO L226 Difference]: Without dead ends: 4468 [2020-12-23 09:37:53,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2020-12-23 09:37:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 3065. [2020-12-23 09:37:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4516 transitions. [2020-12-23 09:37:54,153 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4516 transitions. Word has length 169 [2020-12-23 09:37:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:54,154 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4516 transitions. [2020-12-23 09:37:54,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4516 transitions. [2020-12-23 09:37:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:54,157 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:54,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:54,157 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:37:54,157 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:54,158 INFO L82 PathProgramCache]: Analyzing trace with hash 208577751, now seen corresponding path program 1 times [2020-12-23 09:37:54,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:54,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976685783] [2020-12-23 09:37:54,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:54,268 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:37:54,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976685783] [2020-12-23 09:37:54,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:54,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:54,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118215648] [2020-12-23 09:37:54,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:54,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:54,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:54,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:54,271 INFO L87 Difference]: Start difference. First operand 3065 states and 4516 transitions. Second operand 3 states. [2020-12-23 09:37:54,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:54,435 INFO L93 Difference]: Finished difference Result 6106 states and 8995 transitions. [2020-12-23 09:37:54,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:54,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:37:54,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:54,445 INFO L225 Difference]: With dead ends: 6106 [2020-12-23 09:37:54,445 INFO L226 Difference]: Without dead ends: 3065 [2020-12-23 09:37:54,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:37:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2020-12-23 09:37:54,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2020-12-23 09:37:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:54,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4508 transitions. [2020-12-23 09:37:54,620 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4508 transitions. Word has length 169 [2020-12-23 09:37:54,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:54,620 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4508 transitions. [2020-12-23 09:37:54,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:54,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4508 transitions. [2020-12-23 09:37:54,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:54,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:54,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:54,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:37:54,623 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:54,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:54,624 INFO L82 PathProgramCache]: Analyzing trace with hash -2011994473, now seen corresponding path program 1 times [2020-12-23 09:37:54,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:54,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937900625] [2020-12-23 09:37:54,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:54,683 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:37:54,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937900625] [2020-12-23 09:37:54,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:54,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:54,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313109035] [2020-12-23 09:37:54,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:54,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:54,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:54,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:54,686 INFO L87 Difference]: Start difference. First operand 3065 states and 4508 transitions. Second operand 3 states. [2020-12-23 09:37:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:54,909 INFO L93 Difference]: Finished difference Result 6105 states and 8978 transitions. [2020-12-23 09:37:54,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:54,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:37:54,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:54,929 INFO L225 Difference]: With dead ends: 6105 [2020-12-23 09:37:54,929 INFO L226 Difference]: Without dead ends: 3065 [2020-12-23 09:37:54,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:37:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2020-12-23 09:37:55,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2020-12-23 09:37:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:55,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4500 transitions. [2020-12-23 09:37:55,165 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4500 transitions. Word has length 169 [2020-12-23 09:37:55,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:55,165 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4500 transitions. [2020-12-23 09:37:55,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:55,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4500 transitions. [2020-12-23 09:37:55,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:55,169 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:55,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:37:55,170 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash 133131479, now seen corresponding path program 1 times [2020-12-23 09:37:55,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:55,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915011992] [2020-12-23 09:37:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:55,268 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:37:55,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915011992] [2020-12-23 09:37:55,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:55,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:55,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634197100] [2020-12-23 09:37:55,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:55,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:55,272 INFO L87 Difference]: Start difference. First operand 3065 states and 4500 transitions. Second operand 3 states. [2020-12-23 09:37:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:55,483 INFO L93 Difference]: Finished difference Result 6104 states and 8961 transitions. [2020-12-23 09:37:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:55,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:37:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:55,491 INFO L225 Difference]: With dead ends: 6104 [2020-12-23 09:37:55,491 INFO L226 Difference]: Without dead ends: 3065 [2020-12-23 09:37:55,498 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:37:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2020-12-23 09:37:55,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2020-12-23 09:37:55,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4492 transitions. [2020-12-23 09:37:55,674 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4492 transitions. Word has length 169 [2020-12-23 09:37:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:55,676 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4492 transitions. [2020-12-23 09:37:55,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4492 transitions. [2020-12-23 09:37:55,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:55,679 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:55,679 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:37:55,684 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:55,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:55,685 INFO L82 PathProgramCache]: Analyzing trace with hash 895065751, now seen corresponding path program 1 times [2020-12-23 09:37:55,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:55,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467688270] [2020-12-23 09:37:55,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:55,750 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:37:55,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467688270] [2020-12-23 09:37:55,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:55,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:55,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794908611] [2020-12-23 09:37:55,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:55,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:55,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:55,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:55,753 INFO L87 Difference]: Start difference. First operand 3065 states and 4492 transitions. Second operand 3 states. [2020-12-23 09:37:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:55,936 INFO L93 Difference]: Finished difference Result 6103 states and 8944 transitions. [2020-12-23 09:37:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:55,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:37:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:55,943 INFO L225 Difference]: With dead ends: 6103 [2020-12-23 09:37:55,944 INFO L226 Difference]: Without dead ends: 3065 [2020-12-23 09:37:55,949 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:37:55,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2020-12-23 09:37:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2020-12-23 09:37:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4484 transitions. [2020-12-23 09:37:56,108 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4484 transitions. Word has length 169 [2020-12-23 09:37:56,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:56,108 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4484 transitions. [2020-12-23 09:37:56,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:56,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4484 transitions. [2020-12-23 09:37:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:56,111 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:56,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:56,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:37:56,112 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash -50187049, now seen corresponding path program 1 times [2020-12-23 09:37:56,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:56,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758624220] [2020-12-23 09:37:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:56,172 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:37:56,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758624220] [2020-12-23 09:37:56,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:56,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:56,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103575547] [2020-12-23 09:37:56,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:56,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:56,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:56,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:56,175 INFO L87 Difference]: Start difference. First operand 3065 states and 4484 transitions. Second operand 4 states. [2020-12-23 09:37:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:56,515 INFO L93 Difference]: Finished difference Result 7500 states and 10959 transitions. [2020-12-23 09:37:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:56,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:37:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:56,525 INFO L225 Difference]: With dead ends: 7500 [2020-12-23 09:37:56,525 INFO L226 Difference]: Without dead ends: 4463 [2020-12-23 09:37:56,532 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:56,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4463 states. [2020-12-23 09:37:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4463 to 3065. [2020-12-23 09:37:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4481 transitions. [2020-12-23 09:37:56,740 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4481 transitions. Word has length 169 [2020-12-23 09:37:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:56,742 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4481 transitions. [2020-12-23 09:37:56,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4481 transitions. [2020-12-23 09:37:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:56,745 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:56,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:56,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:37:56,746 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:56,746 INFO L82 PathProgramCache]: Analyzing trace with hash -590616555, now seen corresponding path program 1 times [2020-12-23 09:37:56,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:56,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806019015] [2020-12-23 09:37:56,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:56,823 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:37:56,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806019015] [2020-12-23 09:37:56,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:56,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:56,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874894484] [2020-12-23 09:37:56,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:56,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:56,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:56,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:56,826 INFO L87 Difference]: Start difference. First operand 3065 states and 4481 transitions. Second operand 4 states. [2020-12-23 09:37:57,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:57,246 INFO L93 Difference]: Finished difference Result 7405 states and 10816 transitions. [2020-12-23 09:37:57,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:57,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:37:57,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:57,255 INFO L225 Difference]: With dead ends: 7405 [2020-12-23 09:37:57,255 INFO L226 Difference]: Without dead ends: 4370 [2020-12-23 09:37:57,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2020-12-23 09:37:57,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 3065. [2020-12-23 09:37:57,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4478 transitions. [2020-12-23 09:37:57,448 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4478 transitions. Word has length 169 [2020-12-23 09:37:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:57,448 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4478 transitions. [2020-12-23 09:37:57,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4478 transitions. [2020-12-23 09:37:57,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:57,451 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:57,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:37:57,452 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:57,452 INFO L82 PathProgramCache]: Analyzing trace with hash -180006189, now seen corresponding path program 1 times [2020-12-23 09:37:57,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:57,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583298039] [2020-12-23 09:37:57,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:57,537 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:37:57,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583298039] [2020-12-23 09:37:57,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:57,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:57,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237907738] [2020-12-23 09:37:57,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:57,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:57,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:57,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:57,539 INFO L87 Difference]: Start difference. First operand 3065 states and 4478 transitions. Second operand 3 states. [2020-12-23 09:37:57,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:57,771 INFO L93 Difference]: Finished difference Result 6099 states and 8911 transitions. [2020-12-23 09:37:57,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:57,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:37:57,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:57,777 INFO L225 Difference]: With dead ends: 6099 [2020-12-23 09:37:57,778 INFO L226 Difference]: Without dead ends: 3065 [2020-12-23 09:37:57,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:37:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2020-12-23 09:37:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2020-12-23 09:37:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4444 transitions. [2020-12-23 09:37:57,968 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4444 transitions. Word has length 169 [2020-12-23 09:37:57,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:57,968 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4444 transitions. [2020-12-23 09:37:57,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:57,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4444 transitions. [2020-12-23 09:37:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:57,971 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:57,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:37:57,972 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:57,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1967876011, now seen corresponding path program 1 times [2020-12-23 09:37:57,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:57,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115497961] [2020-12-23 09:37:57,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:58,042 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:37:58,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115497961] [2020-12-23 09:37:58,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:58,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:58,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225254438] [2020-12-23 09:37:58,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:58,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:58,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:58,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:58,046 INFO L87 Difference]: Start difference. First operand 3065 states and 4444 transitions. Second operand 4 states. [2020-12-23 09:37:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:58,549 INFO L93 Difference]: Finished difference Result 7401 states and 10722 transitions. [2020-12-23 09:37:58,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:58,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:37:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:58,559 INFO L225 Difference]: With dead ends: 7401 [2020-12-23 09:37:58,559 INFO L226 Difference]: Without dead ends: 4368 [2020-12-23 09:37:58,565 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4368 states. [2020-12-23 09:37:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4368 to 3065. [2020-12-23 09:37:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4441 transitions. [2020-12-23 09:37:58,809 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4441 transitions. Word has length 169 [2020-12-23 09:37:58,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:58,809 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4441 transitions. [2020-12-23 09:37:58,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4441 transitions. [2020-12-23 09:37:58,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:58,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:58,812 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:58,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:37:58,813 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:58,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:58,813 INFO L82 PathProgramCache]: Analyzing trace with hash 191208083, now seen corresponding path program 1 times [2020-12-23 09:37:58,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:58,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061636993] [2020-12-23 09:37:58,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:58,902 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:37:58,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061636993] [2020-12-23 09:37:58,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:58,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:58,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877795753] [2020-12-23 09:37:58,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:58,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:58,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:58,906 INFO L87 Difference]: Start difference. First operand 3065 states and 4441 transitions. Second operand 3 states. [2020-12-23 09:37:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:59,127 INFO L93 Difference]: Finished difference Result 6097 states and 8835 transitions. [2020-12-23 09:37:59,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:59,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:37:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:59,134 INFO L225 Difference]: With dead ends: 6097 [2020-12-23 09:37:59,134 INFO L226 Difference]: Without dead ends: 3065 [2020-12-23 09:37:59,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:37:59,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2020-12-23 09:37:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2020-12-23 09:37:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:37:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4407 transitions. [2020-12-23 09:37:59,313 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4407 transitions. Word has length 169 [2020-12-23 09:37:59,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:59,313 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4407 transitions. [2020-12-23 09:37:59,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:59,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4407 transitions. [2020-12-23 09:37:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:37:59,315 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:59,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:59,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:37:59,316 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1983127341, now seen corresponding path program 1 times [2020-12-23 09:37:59,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:59,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350352087] [2020-12-23 09:37:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:59,402 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:37:59,402 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350352087] [2020-12-23 09:37:59,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:59,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:59,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872347583] [2020-12-23 09:37:59,405 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:59,405 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:59,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:59,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:59,407 INFO L87 Difference]: Start difference. First operand 3065 states and 4407 transitions. Second operand 4 states. [2020-12-23 09:37:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:59,840 INFO L93 Difference]: Finished difference Result 7397 states and 10628 transitions. [2020-12-23 09:37:59,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:59,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:37:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:59,850 INFO L225 Difference]: With dead ends: 7397 [2020-12-23 09:37:59,850 INFO L226 Difference]: Without dead ends: 4366 [2020-12-23 09:37:59,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4366 states. [2020-12-23 09:38:00,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4366 to 3065. [2020-12-23 09:38:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:38:00,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4404 transitions. [2020-12-23 09:38:00,068 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4404 transitions. Word has length 169 [2020-12-23 09:38:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:00,068 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4404 transitions. [2020-12-23 09:38:00,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4404 transitions. [2020-12-23 09:38:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:00,070 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:00,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:00,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:38:00,071 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:00,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:00,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1565238639, now seen corresponding path program 1 times [2020-12-23 09:38:00,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:00,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845175609] [2020-12-23 09:38:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:00,134 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:38:00,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845175609] [2020-12-23 09:38:00,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:00,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:00,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112346370] [2020-12-23 09:38:00,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:00,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:00,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:00,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:00,137 INFO L87 Difference]: Start difference. First operand 3065 states and 4404 transitions. Second operand 4 states. [2020-12-23 09:38:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:00,614 INFO L93 Difference]: Finished difference Result 7395 states and 10618 transitions. [2020-12-23 09:38:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:38:00,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:38:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:00,625 INFO L225 Difference]: With dead ends: 7395 [2020-12-23 09:38:00,625 INFO L226 Difference]: Without dead ends: 4365 [2020-12-23 09:38:00,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:00,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2020-12-23 09:38:00,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 3065. [2020-12-23 09:38:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:38:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4401 transitions. [2020-12-23 09:38:00,843 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4401 transitions. Word has length 169 [2020-12-23 09:38:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:00,844 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4401 transitions. [2020-12-23 09:38:00,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4401 transitions. [2020-12-23 09:38:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:00,845 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:00,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:00,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:38:00,846 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:00,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash -166285037, now seen corresponding path program 1 times [2020-12-23 09:38:00,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:00,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291011471] [2020-12-23 09:38:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:00,908 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:38:00,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291011471] [2020-12-23 09:38:00,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:00,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:00,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623808366] [2020-12-23 09:38:00,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:00,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:00,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:00,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:00,911 INFO L87 Difference]: Start difference. First operand 3065 states and 4401 transitions. Second operand 4 states. [2020-12-23 09:38:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:01,367 INFO L93 Difference]: Finished difference Result 7393 states and 10608 transitions. [2020-12-23 09:38:01,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:38:01,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:38:01,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:01,377 INFO L225 Difference]: With dead ends: 7393 [2020-12-23 09:38:01,377 INFO L226 Difference]: Without dead ends: 4364 [2020-12-23 09:38:01,382 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4364 states. [2020-12-23 09:38:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4364 to 3065. [2020-12-23 09:38:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:38:01,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4398 transitions. [2020-12-23 09:38:01,640 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4398 transitions. Word has length 169 [2020-12-23 09:38:01,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:01,640 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4398 transitions. [2020-12-23 09:38:01,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:01,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4398 transitions. [2020-12-23 09:38:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:01,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:01,642 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:01,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:38:01,643 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:01,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:01,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1783725487, now seen corresponding path program 1 times [2020-12-23 09:38:01,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:01,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616652326] [2020-12-23 09:38:01,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:01,711 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:38:01,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616652326] [2020-12-23 09:38:01,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:01,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:01,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81404078] [2020-12-23 09:38:01,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:01,714 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:01,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:01,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:01,715 INFO L87 Difference]: Start difference. First operand 3065 states and 4398 transitions. Second operand 4 states. [2020-12-23 09:38:02,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:02,196 INFO L93 Difference]: Finished difference Result 7389 states and 10594 transitions. [2020-12-23 09:38:02,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:38:02,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:38:02,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:02,206 INFO L225 Difference]: With dead ends: 7389 [2020-12-23 09:38:02,206 INFO L226 Difference]: Without dead ends: 4362 [2020-12-23 09:38:02,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2020-12-23 09:38:02,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 3065. [2020-12-23 09:38:02,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:38:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4395 transitions. [2020-12-23 09:38:02,455 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4395 transitions. Word has length 169 [2020-12-23 09:38:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:02,455 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4395 transitions. [2020-12-23 09:38:02,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4395 transitions. [2020-12-23 09:38:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:02,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:02,457 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:02,457 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:38:02,458 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:02,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:02,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1494906097, now seen corresponding path program 1 times [2020-12-23 09:38:02,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:02,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79994345] [2020-12-23 09:38:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:02,570 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:38:02,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79994345] [2020-12-23 09:38:02,571 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:02,571 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:02,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820662098] [2020-12-23 09:38:02,572 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:02,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:02,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:02,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:02,573 INFO L87 Difference]: Start difference. First operand 3065 states and 4395 transitions. Second operand 4 states. [2020-12-23 09:38:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:03,038 INFO L93 Difference]: Finished difference Result 7387 states and 10584 transitions. [2020-12-23 09:38:03,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:38:03,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:38:03,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:03,051 INFO L225 Difference]: With dead ends: 7387 [2020-12-23 09:38:03,051 INFO L226 Difference]: Without dead ends: 4361 [2020-12-23 09:38:03,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:03,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2020-12-23 09:38:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 3065. [2020-12-23 09:38:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:38:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4392 transitions. [2020-12-23 09:38:03,309 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4392 transitions. Word has length 169 [2020-12-23 09:38:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:03,309 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4392 transitions. [2020-12-23 09:38:03,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4392 transitions. [2020-12-23 09:38:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:03,311 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:03,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:03,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:38:03,312 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:03,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:03,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2039778671, now seen corresponding path program 1 times [2020-12-23 09:38:03,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:03,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303036778] [2020-12-23 09:38:03,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:03,382 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:38:03,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303036778] [2020-12-23 09:38:03,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:03,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:03,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020880304] [2020-12-23 09:38:03,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:03,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:03,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:03,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:03,388 INFO L87 Difference]: Start difference. First operand 3065 states and 4392 transitions. Second operand 4 states. [2020-12-23 09:38:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:03,871 INFO L93 Difference]: Finished difference Result 7385 states and 10574 transitions. [2020-12-23 09:38:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:38:03,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:38:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:03,878 INFO L225 Difference]: With dead ends: 7385 [2020-12-23 09:38:03,878 INFO L226 Difference]: Without dead ends: 4360 [2020-12-23 09:38:03,882 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:03,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2020-12-23 09:38:04,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 3065. [2020-12-23 09:38:04,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:38:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4389 transitions. [2020-12-23 09:38:04,136 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4389 transitions. Word has length 169 [2020-12-23 09:38:04,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:04,137 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4389 transitions. [2020-12-23 09:38:04,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4389 transitions. [2020-12-23 09:38:04,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:04,138 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:04,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:04,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:38:04,139 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:04,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1364618545, now seen corresponding path program 1 times [2020-12-23 09:38:04,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:04,140 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808319266] [2020-12-23 09:38:04,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:04,195 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:38:04,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808319266] [2020-12-23 09:38:04,195 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:04,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:38:04,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508758872] [2020-12-23 09:38:04,196 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:04,196 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:04,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:04,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:04,197 INFO L87 Difference]: Start difference. First operand 3065 states and 4389 transitions. Second operand 3 states. [2020-12-23 09:38:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:04,443 INFO L93 Difference]: Finished difference Result 6089 states and 8722 transitions. [2020-12-23 09:38:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:04,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2020-12-23 09:38:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:04,447 INFO L225 Difference]: With dead ends: 6089 [2020-12-23 09:38:04,447 INFO L226 Difference]: Without dead ends: 3065 [2020-12-23 09:38:04,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:38:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2020-12-23 09:38:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2020-12-23 09:38:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2020-12-23 09:38:04,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4355 transitions. [2020-12-23 09:38:04,676 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4355 transitions. Word has length 169 [2020-12-23 09:38:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:04,676 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4355 transitions. [2020-12-23 09:38:04,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4355 transitions. [2020-12-23 09:38:04,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:04,678 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:04,678 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:04,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:38:04,678 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:04,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:04,679 INFO L82 PathProgramCache]: Analyzing trace with hash 936207760, now seen corresponding path program 1 times [2020-12-23 09:38:04,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:04,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953152605] [2020-12-23 09:38:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:04,765 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:38:04,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953152605] [2020-12-23 09:38:04,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:04,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:04,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291219635] [2020-12-23 09:38:04,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:04,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:04,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:04,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:04,767 INFO L87 Difference]: Start difference. First operand 3065 states and 4355 transitions. Second operand 4 states. [2020-12-23 09:38:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:05,483 INFO L93 Difference]: Finished difference Result 11622 states and 16491 transitions. [2020-12-23 09:38:05,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:38:05,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:38:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:05,492 INFO L225 Difference]: With dead ends: 11622 [2020-12-23 09:38:05,492 INFO L226 Difference]: Without dead ends: 8600 [2020-12-23 09:38:05,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8600 states. [2020-12-23 09:38:06,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8600 to 8240. [2020-12-23 09:38:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8240 states. [2020-12-23 09:38:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 11623 transitions. [2020-12-23 09:38:06,013 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 11623 transitions. Word has length 169 [2020-12-23 09:38:06,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:06,013 INFO L481 AbstractCegarLoop]: Abstraction has 8240 states and 11623 transitions. [2020-12-23 09:38:06,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 11623 transitions. [2020-12-23 09:38:06,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:06,016 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:06,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:06,016 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:38:06,016 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:06,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1513950673, now seen corresponding path program 1 times [2020-12-23 09:38:06,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:06,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078319434] [2020-12-23 09:38:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:06,075 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:38:06,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078319434] [2020-12-23 09:38:06,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:06,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:38:06,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789121739] [2020-12-23 09:38:06,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:06,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:06,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:06,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:06,077 INFO L87 Difference]: Start difference. First operand 8240 states and 11623 transitions. Second operand 5 states. [2020-12-23 09:38:07,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:07,343 INFO L93 Difference]: Finished difference Result 21811 states and 30808 transitions. [2020-12-23 09:38:07,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:07,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2020-12-23 09:38:07,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:07,356 INFO L225 Difference]: With dead ends: 21811 [2020-12-23 09:38:07,356 INFO L226 Difference]: Without dead ends: 13624 [2020-12-23 09:38:07,365 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:38:07,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13624 states. [2020-12-23 09:38:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13624 to 8321. [2020-12-23 09:38:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8321 states. [2020-12-23 09:38:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8321 states to 8321 states and 11655 transitions. [2020-12-23 09:38:08,005 INFO L78 Accepts]: Start accepts. Automaton has 8321 states and 11655 transitions. Word has length 169 [2020-12-23 09:38:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:08,005 INFO L481 AbstractCegarLoop]: Abstraction has 8321 states and 11655 transitions. [2020-12-23 09:38:08,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:38:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 8321 states and 11655 transitions. [2020-12-23 09:38:08,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:08,008 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:08,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:08,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:38:08,008 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:08,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:08,009 INFO L82 PathProgramCache]: Analyzing trace with hash -208052013, now seen corresponding path program 1 times [2020-12-23 09:38:08,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:08,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851438327] [2020-12-23 09:38:08,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:08,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:08,068 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:38:08,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851438327] [2020-12-23 09:38:08,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:08,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:38:08,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154306257] [2020-12-23 09:38:08,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:08,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:08,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:08,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:08,071 INFO L87 Difference]: Start difference. First operand 8321 states and 11655 transitions. Second operand 5 states. [2020-12-23 09:38:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:08,879 INFO L93 Difference]: Finished difference Result 17986 states and 25170 transitions. [2020-12-23 09:38:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:08,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2020-12-23 09:38:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:08,890 INFO L225 Difference]: With dead ends: 17986 [2020-12-23 09:38:08,891 INFO L226 Difference]: Without dead ends: 9725 [2020-12-23 09:38:08,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:38:08,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9725 states. [2020-12-23 09:38:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9725 to 8327. [2020-12-23 09:38:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8327 states. [2020-12-23 09:38:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8327 states to 8327 states and 11587 transitions. [2020-12-23 09:38:09,433 INFO L78 Accepts]: Start accepts. Automaton has 8327 states and 11587 transitions. Word has length 169 [2020-12-23 09:38:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:09,433 INFO L481 AbstractCegarLoop]: Abstraction has 8327 states and 11587 transitions. [2020-12-23 09:38:09,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:38:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 8327 states and 11587 transitions. [2020-12-23 09:38:09,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:09,435 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:09,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:09,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:38:09,435 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:09,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1855414955, now seen corresponding path program 1 times [2020-12-23 09:38:09,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:09,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791983049] [2020-12-23 09:38:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:09,498 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:38:09,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791983049] [2020-12-23 09:38:09,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:09,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:09,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235522508] [2020-12-23 09:38:09,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:09,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:09,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:09,501 INFO L87 Difference]: Start difference. First operand 8327 states and 11587 transitions. Second operand 4 states. [2020-12-23 09:38:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:11,497 INFO L93 Difference]: Finished difference Result 32053 states and 44558 transitions. [2020-12-23 09:38:11,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:38:11,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:38:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:11,520 INFO L225 Difference]: With dead ends: 32053 [2020-12-23 09:38:11,520 INFO L226 Difference]: Without dead ends: 23788 [2020-12-23 09:38:11,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:11,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23788 states. [2020-12-23 09:38:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23788 to 22956. [2020-12-23 09:38:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22956 states. [2020-12-23 09:38:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22956 states to 22956 states and 31727 transitions. [2020-12-23 09:38:13,252 INFO L78 Accepts]: Start accepts. Automaton has 22956 states and 31727 transitions. Word has length 169 [2020-12-23 09:38:13,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:13,252 INFO L481 AbstractCegarLoop]: Abstraction has 22956 states and 31727 transitions. [2020-12-23 09:38:13,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:13,252 INFO L276 IsEmpty]: Start isEmpty. Operand 22956 states and 31727 transitions. [2020-12-23 09:38:13,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:13,254 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:13,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:13,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:38:13,254 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:13,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1474944790, now seen corresponding path program 1 times [2020-12-23 09:38:13,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:13,255 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775746354] [2020-12-23 09:38:13,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:13,313 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:38:13,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775746354] [2020-12-23 09:38:13,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:13,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:38:13,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46143423] [2020-12-23 09:38:13,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:13,314 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:13,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:13,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:13,315 INFO L87 Difference]: Start difference. First operand 22956 states and 31727 transitions. Second operand 5 states. [2020-12-23 09:38:16,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:16,672 INFO L93 Difference]: Finished difference Result 59922 states and 83158 transitions. [2020-12-23 09:38:16,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:16,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2020-12-23 09:38:16,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:16,721 INFO L225 Difference]: With dead ends: 59922 [2020-12-23 09:38:16,721 INFO L226 Difference]: Without dead ends: 37032 [2020-12-23 09:38:16,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:38:16,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37032 states. [2020-12-23 09:38:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37032 to 23181. [2020-12-23 09:38:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23181 states. [2020-12-23 09:38:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23181 states to 23181 states and 31817 transitions. [2020-12-23 09:38:18,922 INFO L78 Accepts]: Start accepts. Automaton has 23181 states and 31817 transitions. Word has length 169 [2020-12-23 09:38:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:18,922 INFO L481 AbstractCegarLoop]: Abstraction has 23181 states and 31817 transitions. [2020-12-23 09:38:18,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:38:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 23181 states and 31817 transitions. [2020-12-23 09:38:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:18,924 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:18,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:18,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:38:18,925 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1593386264, now seen corresponding path program 1 times [2020-12-23 09:38:18,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:18,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181253406] [2020-12-23 09:38:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:19,008 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:38:19,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181253406] [2020-12-23 09:38:19,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:19,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:38:19,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971416643] [2020-12-23 09:38:19,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:19,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:19,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:19,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:19,011 INFO L87 Difference]: Start difference. First operand 23181 states and 31817 transitions. Second operand 5 states. [2020-12-23 09:38:21,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:21,533 INFO L93 Difference]: Finished difference Result 51179 states and 70048 transitions. [2020-12-23 09:38:21,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:21,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2020-12-23 09:38:21,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:21,563 INFO L225 Difference]: With dead ends: 51179 [2020-12-23 09:38:21,563 INFO L226 Difference]: Without dead ends: 28071 [2020-12-23 09:38:21,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:38:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28071 states. [2020-12-23 09:38:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28071 to 23199. [2020-12-23 09:38:23,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23199 states. [2020-12-23 09:38:23,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23199 states to 23199 states and 31631 transitions. [2020-12-23 09:38:23,739 INFO L78 Accepts]: Start accepts. Automaton has 23199 states and 31631 transitions. Word has length 169 [2020-12-23 09:38:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:23,739 INFO L481 AbstractCegarLoop]: Abstraction has 23199 states and 31631 transitions. [2020-12-23 09:38:23,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:38:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 23199 states and 31631 transitions. [2020-12-23 09:38:23,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:23,740 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:23,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:23,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 09:38:23,741 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:23,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:23,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1670540134, now seen corresponding path program 1 times [2020-12-23 09:38:23,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:23,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717938627] [2020-12-23 09:38:23,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:23,810 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:38:23,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717938627] [2020-12-23 09:38:23,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:23,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:23,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446403385] [2020-12-23 09:38:23,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:23,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:23,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:23,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:23,812 INFO L87 Difference]: Start difference. First operand 23199 states and 31631 transitions. Second operand 4 states. [2020-12-23 09:38:29,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:29,537 INFO L93 Difference]: Finished difference Result 89594 states and 122107 transitions. [2020-12-23 09:38:29,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:38:29,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:38:29,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:29,606 INFO L225 Difference]: With dead ends: 89594 [2020-12-23 09:38:29,606 INFO L226 Difference]: Without dead ends: 66470 [2020-12-23 09:38:29,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66470 states. [2020-12-23 09:38:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66470 to 64590. [2020-12-23 09:38:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64590 states. [2020-12-23 09:38:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64590 states to 64590 states and 87548 transitions. [2020-12-23 09:38:35,257 INFO L78 Accepts]: Start accepts. Automaton has 64590 states and 87548 transitions. Word has length 169 [2020-12-23 09:38:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:35,257 INFO L481 AbstractCegarLoop]: Abstraction has 64590 states and 87548 transitions. [2020-12-23 09:38:35,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 64590 states and 87548 transitions. [2020-12-23 09:38:35,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:35,259 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:35,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:35,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 09:38:35,260 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:35,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:35,260 INFO L82 PathProgramCache]: Analyzing trace with hash 763015131, now seen corresponding path program 1 times [2020-12-23 09:38:35,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:35,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529103515] [2020-12-23 09:38:35,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:35,319 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:38:35,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529103515] [2020-12-23 09:38:35,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:35,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:38:35,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48445194] [2020-12-23 09:38:35,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:35,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:35,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:35,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:35,321 INFO L87 Difference]: Start difference. First operand 64590 states and 87548 transitions. Second operand 5 states. [2020-12-23 09:38:44,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:44,160 INFO L93 Difference]: Finished difference Result 165880 states and 226232 transitions. [2020-12-23 09:38:44,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:44,161 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2020-12-23 09:38:44,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:44,286 INFO L225 Difference]: With dead ends: 165880 [2020-12-23 09:38:44,286 INFO L226 Difference]: Without dead ends: 101369 [2020-12-23 09:38:44,515 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:38:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101369 states. [2020-12-23 09:38:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101369 to 65217. [2020-12-23 09:38:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65217 states. [2020-12-23 09:38:50,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65217 states to 65217 states and 87800 transitions. [2020-12-23 09:38:50,886 INFO L78 Accepts]: Start accepts. Automaton has 65217 states and 87800 transitions. Word has length 169 [2020-12-23 09:38:50,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:50,886 INFO L481 AbstractCegarLoop]: Abstraction has 65217 states and 87800 transitions. [2020-12-23 09:38:50,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:38:50,886 INFO L276 IsEmpty]: Start isEmpty. Operand 65217 states and 87800 transitions. [2020-12-23 09:38:50,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:38:50,889 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:50,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:50,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 09:38:50,889 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash -120493859, now seen corresponding path program 1 times [2020-12-23 09:38:50,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:50,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959102083] [2020-12-23 09:38:50,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:50,961 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:38:50,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959102083] [2020-12-23 09:38:50,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:50,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:38:50,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281801896] [2020-12-23 09:38:50,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:50,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:50,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:50,963 INFO L87 Difference]: Start difference. First operand 65217 states and 87800 transitions. Second operand 5 states. [2020-12-23 09:39:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:05,506 INFO L93 Difference]: Finished difference Result 230390 states and 313754 transitions. [2020-12-23 09:39:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:39:05,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2020-12-23 09:39:05,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:05,899 INFO L225 Difference]: With dead ends: 230390 [2020-12-23 09:39:05,900 INFO L226 Difference]: Without dead ends: 165259 [2020-12-23 09:39:05,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:39:06,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165259 states. [2020-12-23 09:39:13,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165259 to 66969. [2020-12-23 09:39:13,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66969 states. [2020-12-23 09:39:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66969 states to 66969 states and 89552 transitions. [2020-12-23 09:39:13,308 INFO L78 Accepts]: Start accepts. Automaton has 66969 states and 89552 transitions. Word has length 169 [2020-12-23 09:39:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:13,309 INFO L481 AbstractCegarLoop]: Abstraction has 66969 states and 89552 transitions. [2020-12-23 09:39:13,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:39:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 66969 states and 89552 transitions. [2020-12-23 09:39:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:39:13,310 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:13,311 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:13,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 09:39:13,311 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:39:13,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:13,311 INFO L82 PathProgramCache]: Analyzing trace with hash -706770081, now seen corresponding path program 1 times [2020-12-23 09:39:13,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:13,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122604190] [2020-12-23 09:39:13,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:13,384 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:39:13,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122604190] [2020-12-23 09:39:13,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:13,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:39:13,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994415280] [2020-12-23 09:39:13,386 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:39:13,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:13,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:39:13,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:39:13,387 INFO L87 Difference]: Start difference. First operand 66969 states and 89552 transitions. Second operand 4 states. [2020-12-23 09:39:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:32,151 INFO L93 Difference]: Finished difference Result 258106 states and 345114 transitions. [2020-12-23 09:39:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:39:32,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2020-12-23 09:39:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:32,376 INFO L225 Difference]: With dead ends: 258106 [2020-12-23 09:39:32,377 INFO L226 Difference]: Without dead ends: 191228 [2020-12-23 09:39:32,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:39:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191228 states. [2020-12-23 09:39:51,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191228 to 187064. [2020-12-23 09:39:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187064 states. [2020-12-23 09:39:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187064 states to 187064 states and 248853 transitions. [2020-12-23 09:39:52,251 INFO L78 Accepts]: Start accepts. Automaton has 187064 states and 248853 transitions. Word has length 169 [2020-12-23 09:39:52,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:52,251 INFO L481 AbstractCegarLoop]: Abstraction has 187064 states and 248853 transitions. [2020-12-23 09:39:52,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:39:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 187064 states and 248853 transitions. [2020-12-23 09:39:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2020-12-23 09:39:52,253 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:52,253 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:52,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 09:39:52,261 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:39:52,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:52,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1923956704, now seen corresponding path program 1 times [2020-12-23 09:39:52,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:52,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143927222] [2020-12-23 09:39:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:52,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:39:52,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143927222] [2020-12-23 09:39:52,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:52,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:39:52,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504076844] [2020-12-23 09:39:52,360 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:39:52,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:52,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:39:52,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:39:52,361 INFO L87 Difference]: Start difference. First operand 187064 states and 248853 transitions. Second operand 5 states.