/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.10.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:37:21,545 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:37:21,548 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:37:21,601 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:37:21,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:37:21,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:37:21,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:37:21,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:37:21,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:37:21,628 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:37:21,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:37:21,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:37:21,634 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:37:21,636 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:37:21,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:37:21,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:37:21,655 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:37:21,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:37:21,668 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:37:21,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:37:21,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:37:21,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:37:21,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:37:21,687 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:37:21,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:37:21,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:37:21,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:37:21,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:37:21,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:37:21,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:37:21,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:37:21,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:37:21,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:37:21,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:37:21,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:37:21,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:37:21,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:37:21,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:37:21,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:37:21,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:37:21,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:37:21,723 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:21,776 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:37:21,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:37:21,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:37:21,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:37:21,779 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:37:21,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:37:21,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:37:21,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:37:21,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:37:21,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:37:21,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:37:21,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:37:21,781 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:37:21,782 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:37:21,782 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:37:21,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:37:21,783 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:37:21,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:37:21,783 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:37:21,784 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:37:21,784 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:37:21,784 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:37:21,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:37:21,785 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:37:21,785 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:37:21,785 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:22,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:37:22,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:37:22,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:37:22,223 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:37:22,224 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:37:22,225 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.10.cil.c [2020-12-23 09:37:22,322 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bd0008e2c/a5cfa96728c54bce83593454d76f85b8/FLAG5b276d48c [2020-12-23 09:37:23,081 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:37:23,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.10.cil.c [2020-12-23 09:37:23,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bd0008e2c/a5cfa96728c54bce83593454d76f85b8/FLAG5b276d48c [2020-12-23 09:37:23,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/bd0008e2c/a5cfa96728c54bce83593454d76f85b8 [2020-12-23 09:37:23,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:37:23,362 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:37:23,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:37:23,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:37:23,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:37:23,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:37:23" (1/1) ... [2020-12-23 09:37:23,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f248993 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:23, skipping insertion in model container [2020-12-23 09:37:23,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:37:23" (1/1) ... [2020-12-23 09:37:23,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:37:23,455 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:37:23,672 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.10.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[~__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[~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[~__retres1~11,] 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~11,] 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~11,] 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~11,] 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[~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[~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[~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[~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[~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[~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[~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[~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[~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[~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~12,] [2020-12-23 09:37:23,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:37:23,915 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:37:23,929 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.10.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[~__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[~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[~__retres1~11,] 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~11,] 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~11,] 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~11,] 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[~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[~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[~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[~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[~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[~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[~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[~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[~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[~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~12,] [2020-12-23 09:37:24,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:37:24,075 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:37:24,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:24 WrapperNode [2020-12-23 09:37:24,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:37:24,078 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:37:24,078 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:37:24,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:37:24,087 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:24" (1/1) ... [2020-12-23 09:37:24,103 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:24" (1/1) ... [2020-12-23 09:37:24,234 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:37:24,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:37:24,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:37:24,236 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:37:24,246 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:24" (1/1) ... [2020-12-23 09:37:24,247 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:24" (1/1) ... [2020-12-23 09:37:24,256 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:24" (1/1) ... [2020-12-23 09:37:24,257 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:24" (1/1) ... [2020-12-23 09:37:24,301 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:24" (1/1) ... [2020-12-23 09:37:24,381 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:24" (1/1) ... [2020-12-23 09:37:24,396 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:24" (1/1) ... [2020-12-23 09:37:24,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:37:24,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:37:24,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:37:24,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:37:24,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:24" (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:24,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:37:24,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:37:24,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:37:24,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:37:26,822 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:37:26,823 INFO L299 CfgBuilder]: Removed 406 assume(true) statements. [2020-12-23 09:37:26,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:37:26 BoogieIcfgContainer [2020-12-23 09:37:26,829 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:37:26,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:37:26,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:37:26,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:37:26,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:37:23" (1/3) ... [2020-12-23 09:37:26,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48aa424d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:37:26, skipping insertion in model container [2020-12-23 09:37:26,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:37:24" (2/3) ... [2020-12-23 09:37:26,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48aa424d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:37:26, skipping insertion in model container [2020-12-23 09:37:26,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:37:26" (3/3) ... [2020-12-23 09:37:26,842 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.10.cil.c [2020-12-23 09:37:26,856 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:37:26,868 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:37:26,908 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:37:26,963 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:37:26,964 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:37:26,964 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:37:26,964 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:37:26,964 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:37:26,965 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:37:26,965 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:37:26,965 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:37:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states. [2020-12-23 09:37:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:27,073 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:27,074 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] [2020-12-23 09:37:27,074 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:27,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1296603822, now seen corresponding path program 1 times [2020-12-23 09:37:27,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:27,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870072440] [2020-12-23 09:37:27,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:27,427 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:27,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870072440] [2020-12-23 09:37:27,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:27,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:27,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480345131] [2020-12-23 09:37:27,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:27,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:27,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:27,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:27,464 INFO L87 Difference]: Start difference. First operand 1256 states. Second operand 3 states. [2020-12-23 09:37:27,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:27,684 INFO L93 Difference]: Finished difference Result 2507 states and 3811 transitions. [2020-12-23 09:37:27,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:27,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:37:27,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:27,723 INFO L225 Difference]: With dead ends: 2507 [2020-12-23 09:37:27,723 INFO L226 Difference]: Without dead ends: 1252 [2020-12-23 09:37:27,735 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:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2020-12-23 09:37:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2020-12-23 09:37:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2020-12-23 09:37:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1875 transitions. [2020-12-23 09:37:27,920 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1875 transitions. Word has length 145 [2020-12-23 09:37:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:27,921 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1875 transitions. [2020-12-23 09:37:27,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:27,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1875 transitions. [2020-12-23 09:37:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:27,934 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:27,934 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] [2020-12-23 09:37:27,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:37:27,935 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:27,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:27,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1452584364, now seen corresponding path program 1 times [2020-12-23 09:37:27,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:27,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596446242] [2020-12-23 09:37:27,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:28,136 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:28,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596446242] [2020-12-23 09:37:28,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:28,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:28,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659262039] [2020-12-23 09:37:28,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:28,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:28,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:28,140 INFO L87 Difference]: Start difference. First operand 1252 states and 1875 transitions. Second operand 3 states. [2020-12-23 09:37:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:28,210 INFO L93 Difference]: Finished difference Result 2491 states and 3728 transitions. [2020-12-23 09:37:28,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:28,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:37:28,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:28,218 INFO L225 Difference]: With dead ends: 2491 [2020-12-23 09:37:28,218 INFO L226 Difference]: Without dead ends: 1252 [2020-12-23 09:37:28,221 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:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2020-12-23 09:37:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2020-12-23 09:37:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2020-12-23 09:37:28,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1874 transitions. [2020-12-23 09:37:28,273 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1874 transitions. Word has length 145 [2020-12-23 09:37:28,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:28,273 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1874 transitions. [2020-12-23 09:37:28,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:28,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1874 transitions. [2020-12-23 09:37:28,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:28,275 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:28,276 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] [2020-12-23 09:37:28,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:37:28,276 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:28,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:28,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1089117866, now seen corresponding path program 1 times [2020-12-23 09:37:28,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:28,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544717778] [2020-12-23 09:37:28,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:28,408 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:28,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544717778] [2020-12-23 09:37:28,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:28,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:28,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081245770] [2020-12-23 09:37:28,412 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:28,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:28,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:28,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:28,417 INFO L87 Difference]: Start difference. First operand 1252 states and 1874 transitions. Second operand 3 states. [2020-12-23 09:37:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:28,652 INFO L93 Difference]: Finished difference Result 3530 states and 5268 transitions. [2020-12-23 09:37:28,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:28,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:37:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:28,666 INFO L225 Difference]: With dead ends: 3530 [2020-12-23 09:37:28,667 INFO L226 Difference]: Without dead ends: 2293 [2020-12-23 09:37:28,670 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:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2020-12-23 09:37:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2291. [2020-12-23 09:37:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:28,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3402 transitions. [2020-12-23 09:37:28,795 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3402 transitions. Word has length 145 [2020-12-23 09:37:28,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:28,802 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3402 transitions. [2020-12-23 09:37:28,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:28,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3402 transitions. [2020-12-23 09:37:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:28,807 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:28,807 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] [2020-12-23 09:37:28,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:37:28,808 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:28,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:28,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1505142550, now seen corresponding path program 1 times [2020-12-23 09:37:28,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:28,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109121416] [2020-12-23 09:37:28,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:28,993 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:28,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109121416] [2020-12-23 09:37:28,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:28,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:28,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539324330] [2020-12-23 09:37:28,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:28,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:28,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:28,998 INFO L87 Difference]: Start difference. First operand 2291 states and 3402 transitions. Second operand 4 states. [2020-12-23 09:37:29,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:29,388 INFO L93 Difference]: Finished difference Result 5606 states and 8308 transitions. [2020-12-23 09:37:29,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:29,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:29,415 INFO L225 Difference]: With dead ends: 5606 [2020-12-23 09:37:29,415 INFO L226 Difference]: Without dead ends: 3331 [2020-12-23 09:37:29,423 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:29,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2020-12-23 09:37:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 2291. [2020-12-23 09:37:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:29,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3399 transitions. [2020-12-23 09:37:29,596 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3399 transitions. Word has length 145 [2020-12-23 09:37:29,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:29,596 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3399 transitions. [2020-12-23 09:37:29,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:29,596 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3399 transitions. [2020-12-23 09:37:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:29,599 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:29,599 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] [2020-12-23 09:37:29,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:37:29,599 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:29,600 INFO L82 PathProgramCache]: Analyzing trace with hash -829982424, now seen corresponding path program 1 times [2020-12-23 09:37:29,600 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:29,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984801453] [2020-12-23 09:37:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:29,768 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:29,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984801453] [2020-12-23 09:37:29,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:29,769 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:29,769 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265991051] [2020-12-23 09:37:29,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:29,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:29,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:29,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:29,772 INFO L87 Difference]: Start difference. First operand 2291 states and 3399 transitions. Second operand 4 states. [2020-12-23 09:37:30,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:30,083 INFO L93 Difference]: Finished difference Result 5604 states and 8298 transitions. [2020-12-23 09:37:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:30,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:30,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:30,108 INFO L225 Difference]: With dead ends: 5604 [2020-12-23 09:37:30,108 INFO L226 Difference]: Without dead ends: 3330 [2020-12-23 09:37:30,114 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:30,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3330 states. [2020-12-23 09:37:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 2291. [2020-12-23 09:37:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3396 transitions. [2020-12-23 09:37:30,256 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3396 transitions. Word has length 145 [2020-12-23 09:37:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:30,256 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3396 transitions. [2020-12-23 09:37:30,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:30,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3396 transitions. [2020-12-23 09:37:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:30,258 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:30,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] [2020-12-23 09:37:30,259 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:37:30,259 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:30,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:30,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1778034390, now seen corresponding path program 1 times [2020-12-23 09:37:30,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:30,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544951438] [2020-12-23 09:37:30,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:30,341 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:30,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544951438] [2020-12-23 09:37:30,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:30,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:30,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895545981] [2020-12-23 09:37:30,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:30,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:30,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:30,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:30,344 INFO L87 Difference]: Start difference. First operand 2291 states and 3396 transitions. Second operand 4 states. [2020-12-23 09:37:30,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:30,697 INFO L93 Difference]: Finished difference Result 5602 states and 8288 transitions. [2020-12-23 09:37:30,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:30,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:30,719 INFO L225 Difference]: With dead ends: 5602 [2020-12-23 09:37:30,719 INFO L226 Difference]: Without dead ends: 3329 [2020-12-23 09:37:30,725 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:30,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2020-12-23 09:37:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 2291. [2020-12-23 09:37:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3393 transitions. [2020-12-23 09:37:30,882 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3393 transitions. Word has length 145 [2020-12-23 09:37:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:30,882 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3393 transitions. [2020-12-23 09:37:30,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:30,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3393 transitions. [2020-12-23 09:37:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:30,884 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:30,885 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] [2020-12-23 09:37:30,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:37:30,885 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:30,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1932161256, now seen corresponding path program 1 times [2020-12-23 09:37:30,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:30,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266331704] [2020-12-23 09:37:30,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:30,975 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:30,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266331704] [2020-12-23 09:37:30,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:30,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:30,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255803867] [2020-12-23 09:37:30,977 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:30,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:30,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:30,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:30,978 INFO L87 Difference]: Start difference. First operand 2291 states and 3393 transitions. Second operand 3 states. [2020-12-23 09:37:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:31,199 INFO L93 Difference]: Finished difference Result 4563 states and 6757 transitions. [2020-12-23 09:37:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:31,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:37:31,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:31,212 INFO L225 Difference]: With dead ends: 4563 [2020-12-23 09:37:31,212 INFO L226 Difference]: Without dead ends: 2291 [2020-12-23 09:37:31,216 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:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2020-12-23 09:37:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2020-12-23 09:37:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3385 transitions. [2020-12-23 09:37:31,369 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3385 transitions. Word has length 145 [2020-12-23 09:37:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:31,370 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3385 transitions. [2020-12-23 09:37:31,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3385 transitions. [2020-12-23 09:37:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:31,372 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:31,372 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] [2020-12-23 09:37:31,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:37:31,372 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:31,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:31,373 INFO L82 PathProgramCache]: Analyzing trace with hash 125848360, now seen corresponding path program 1 times [2020-12-23 09:37:31,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:31,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722447163] [2020-12-23 09:37:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:31,427 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:31,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722447163] [2020-12-23 09:37:31,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:31,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:31,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780847634] [2020-12-23 09:37:31,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:31,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:31,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:31,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:31,430 INFO L87 Difference]: Start difference. First operand 2291 states and 3385 transitions. Second operand 3 states. [2020-12-23 09:37:31,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:31,599 INFO L93 Difference]: Finished difference Result 4562 states and 6740 transitions. [2020-12-23 09:37:31,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:31,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:37:31,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:31,611 INFO L225 Difference]: With dead ends: 4562 [2020-12-23 09:37:31,612 INFO L226 Difference]: Without dead ends: 2291 [2020-12-23 09:37:31,617 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:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2020-12-23 09:37:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2020-12-23 09:37:31,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:31,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3377 transitions. [2020-12-23 09:37:31,805 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3377 transitions. Word has length 145 [2020-12-23 09:37:31,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:31,806 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3377 transitions. [2020-12-23 09:37:31,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:31,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3377 transitions. [2020-12-23 09:37:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:31,808 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:31,809 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] [2020-12-23 09:37:31,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:37:31,809 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:31,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:31,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2145790184, now seen corresponding path program 1 times [2020-12-23 09:37:31,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:31,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549277196] [2020-12-23 09:37:31,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:31,890 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:31,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549277196] [2020-12-23 09:37:31,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:31,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:31,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774091733] [2020-12-23 09:37:31,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:31,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:31,898 INFO L87 Difference]: Start difference. First operand 2291 states and 3377 transitions. Second operand 3 states. [2020-12-23 09:37:32,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:32,088 INFO L93 Difference]: Finished difference Result 4560 states and 6721 transitions. [2020-12-23 09:37:32,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:32,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:37:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:32,102 INFO L225 Difference]: With dead ends: 4560 [2020-12-23 09:37:32,103 INFO L226 Difference]: Without dead ends: 2291 [2020-12-23 09:37:32,108 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:32,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2020-12-23 09:37:32,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2020-12-23 09:37:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3369 transitions. [2020-12-23 09:37:32,258 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3369 transitions. Word has length 145 [2020-12-23 09:37:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:32,258 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3369 transitions. [2020-12-23 09:37:32,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3369 transitions. [2020-12-23 09:37:32,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:32,260 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:32,260 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] [2020-12-23 09:37:32,261 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:37:32,261 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:32,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:32,262 INFO L82 PathProgramCache]: Analyzing trace with hash -542607704, now seen corresponding path program 1 times [2020-12-23 09:37:32,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:32,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200083595] [2020-12-23 09:37:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:32,332 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:32,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200083595] [2020-12-23 09:37:32,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:32,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:32,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222121762] [2020-12-23 09:37:32,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:32,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:32,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:32,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:32,335 INFO L87 Difference]: Start difference. First operand 2291 states and 3369 transitions. Second operand 3 states. [2020-12-23 09:37:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:32,547 INFO L93 Difference]: Finished difference Result 4559 states and 6704 transitions. [2020-12-23 09:37:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:32,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:37:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:32,563 INFO L225 Difference]: With dead ends: 4559 [2020-12-23 09:37:32,564 INFO L226 Difference]: Without dead ends: 2291 [2020-12-23 09:37:32,568 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:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2020-12-23 09:37:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2020-12-23 09:37:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3361 transitions. [2020-12-23 09:37:32,723 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3361 transitions. Word has length 145 [2020-12-23 09:37:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:32,724 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3361 transitions. [2020-12-23 09:37:32,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:32,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3361 transitions. [2020-12-23 09:37:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:32,726 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:32,726 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] [2020-12-23 09:37:32,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:37:32,726 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:32,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash -75140888, now seen corresponding path program 1 times [2020-12-23 09:37:32,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:32,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307755171] [2020-12-23 09:37:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:32,788 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:32,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307755171] [2020-12-23 09:37:32,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:32,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:32,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995474032] [2020-12-23 09:37:32,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:32,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:32,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:32,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:32,792 INFO L87 Difference]: Start difference. First operand 2291 states and 3361 transitions. Second operand 3 states. [2020-12-23 09:37:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:32,952 INFO L93 Difference]: Finished difference Result 4558 states and 6687 transitions. [2020-12-23 09:37:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:32,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:37:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:32,980 INFO L225 Difference]: With dead ends: 4558 [2020-12-23 09:37:32,980 INFO L226 Difference]: Without dead ends: 2291 [2020-12-23 09:37:32,990 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:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2020-12-23 09:37:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2020-12-23 09:37:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:33,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3353 transitions. [2020-12-23 09:37:33,138 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3353 transitions. Word has length 145 [2020-12-23 09:37:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:33,138 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3353 transitions. [2020-12-23 09:37:33,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:33,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3353 transitions. [2020-12-23 09:37:33,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:33,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:33,141 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] [2020-12-23 09:37:33,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:37:33,141 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:33,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:33,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2125549786, now seen corresponding path program 1 times [2020-12-23 09:37:33,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:33,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543873453] [2020-12-23 09:37:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:33,226 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:33,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543873453] [2020-12-23 09:37:33,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:33,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:33,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750119178] [2020-12-23 09:37:33,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:33,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:33,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:33,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:33,230 INFO L87 Difference]: Start difference. First operand 2291 states and 3353 transitions. Second operand 3 states. [2020-12-23 09:37:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:33,390 INFO L93 Difference]: Finished difference Result 4557 states and 6670 transitions. [2020-12-23 09:37:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:33,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:37:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:33,398 INFO L225 Difference]: With dead ends: 4557 [2020-12-23 09:37:33,398 INFO L226 Difference]: Without dead ends: 2291 [2020-12-23 09:37:33,403 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:33,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2020-12-23 09:37:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2020-12-23 09:37:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3345 transitions. [2020-12-23 09:37:33,569 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3345 transitions. Word has length 145 [2020-12-23 09:37:33,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:33,569 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3345 transitions. [2020-12-23 09:37:33,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:33,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3345 transitions. [2020-12-23 09:37:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:33,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:33,573 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] [2020-12-23 09:37:33,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:37:33,573 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:33,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:33,574 INFO L82 PathProgramCache]: Analyzing trace with hash 413481318, now seen corresponding path program 1 times [2020-12-23 09:37:33,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:33,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949210976] [2020-12-23 09:37:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:33,665 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:33,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949210976] [2020-12-23 09:37:33,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:33,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:33,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858565872] [2020-12-23 09:37:33,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:33,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:33,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:33,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:33,669 INFO L87 Difference]: Start difference. First operand 2291 states and 3345 transitions. Second operand 4 states. [2020-12-23 09:37:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:34,149 INFO L93 Difference]: Finished difference Result 5509 states and 8039 transitions. [2020-12-23 09:37:34,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:34,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:34,161 INFO L225 Difference]: With dead ends: 5509 [2020-12-23 09:37:34,162 INFO L226 Difference]: Without dead ends: 3244 [2020-12-23 09:37:34,173 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:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3244 states. [2020-12-23 09:37:34,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3244 to 2291. [2020-12-23 09:37:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3342 transitions. [2020-12-23 09:37:34,337 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3342 transitions. Word has length 145 [2020-12-23 09:37:34,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:34,338 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3342 transitions. [2020-12-23 09:37:34,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3342 transitions. [2020-12-23 09:37:34,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:34,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:34,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:37:34,341 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:34,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:34,342 INFO L82 PathProgramCache]: Analyzing trace with hash -679153884, now seen corresponding path program 1 times [2020-12-23 09:37:34,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:34,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505259570] [2020-12-23 09:37:34,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:34,408 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:34,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505259570] [2020-12-23 09:37:34,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:34,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:34,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229777833] [2020-12-23 09:37:34,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:34,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:34,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:34,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:34,411 INFO L87 Difference]: Start difference. First operand 2291 states and 3342 transitions. Second operand 3 states. [2020-12-23 09:37:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:34,591 INFO L93 Difference]: Finished difference Result 4555 states and 6646 transitions. [2020-12-23 09:37:34,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:34,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:37:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:34,598 INFO L225 Difference]: With dead ends: 4555 [2020-12-23 09:37:34,598 INFO L226 Difference]: Without dead ends: 2291 [2020-12-23 09:37:34,604 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:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2020-12-23 09:37:34,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2020-12-23 09:37:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3312 transitions. [2020-12-23 09:37:34,788 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3312 transitions. Word has length 145 [2020-12-23 09:37:34,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:34,789 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3312 transitions. [2020-12-23 09:37:34,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:34,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3312 transitions. [2020-12-23 09:37:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:34,792 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:34,792 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] [2020-12-23 09:37:34,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:37:34,793 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:34,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1686566556, now seen corresponding path program 1 times [2020-12-23 09:37:34,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:34,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581711970] [2020-12-23 09:37:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:34,878 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:34,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581711970] [2020-12-23 09:37:34,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:34,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:34,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749874209] [2020-12-23 09:37:34,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:34,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:34,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:34,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:34,882 INFO L87 Difference]: Start difference. First operand 2291 states and 3312 transitions. Second operand 4 states. [2020-12-23 09:37:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:35,316 INFO L93 Difference]: Finished difference Result 5505 states and 7955 transitions. [2020-12-23 09:37:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:35,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:35,326 INFO L225 Difference]: With dead ends: 5505 [2020-12-23 09:37:35,326 INFO L226 Difference]: Without dead ends: 3242 [2020-12-23 09:37:35,334 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:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2020-12-23 09:37:35,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 2291. [2020-12-23 09:37:35,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3309 transitions. [2020-12-23 09:37:35,492 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3309 transitions. Word has length 145 [2020-12-23 09:37:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:35,492 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3309 transitions. [2020-12-23 09:37:35,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3309 transitions. [2020-12-23 09:37:35,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:35,494 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:35,495 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] [2020-12-23 09:37:35,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:37:35,496 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash 765925026, now seen corresponding path program 1 times [2020-12-23 09:37:35,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:35,497 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777478443] [2020-12-23 09:37:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:35,558 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:35,558 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777478443] [2020-12-23 09:37:35,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:35,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:35,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370582149] [2020-12-23 09:37:35,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:35,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:35,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:35,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:35,563 INFO L87 Difference]: Start difference. First operand 2291 states and 3309 transitions. Second operand 4 states. [2020-12-23 09:37:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:36,007 INFO L93 Difference]: Finished difference Result 5501 states and 7941 transitions. [2020-12-23 09:37:36,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:36,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:36,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:36,017 INFO L225 Difference]: With dead ends: 5501 [2020-12-23 09:37:36,017 INFO L226 Difference]: Without dead ends: 3240 [2020-12-23 09:37:36,023 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:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2020-12-23 09:37:36,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 2291. [2020-12-23 09:37:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3306 transitions. [2020-12-23 09:37:36,193 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3306 transitions. Word has length 145 [2020-12-23 09:37:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:36,193 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3306 transitions. [2020-12-23 09:37:36,193 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3306 transitions. [2020-12-23 09:37:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:36,195 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:36,195 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] [2020-12-23 09:37:36,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:37:36,196 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash 433281888, now seen corresponding path program 1 times [2020-12-23 09:37:36,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:36,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365154489] [2020-12-23 09:37:36,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:36,275 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:36,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365154489] [2020-12-23 09:37:36,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:36,276 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:36,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820353183] [2020-12-23 09:37:36,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:36,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:36,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:36,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:36,278 INFO L87 Difference]: Start difference. First operand 2291 states and 3306 transitions. Second operand 4 states. [2020-12-23 09:37:36,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:36,715 INFO L93 Difference]: Finished difference Result 5499 states and 7931 transitions. [2020-12-23 09:37:36,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:36,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:36,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:36,723 INFO L225 Difference]: With dead ends: 5499 [2020-12-23 09:37:36,723 INFO L226 Difference]: Without dead ends: 3239 [2020-12-23 09:37:36,728 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:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2020-12-23 09:37:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 2291. [2020-12-23 09:37:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3303 transitions. [2020-12-23 09:37:36,896 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3303 transitions. Word has length 145 [2020-12-23 09:37:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:36,896 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3303 transitions. [2020-12-23 09:37:36,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3303 transitions. [2020-12-23 09:37:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:36,898 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:36,899 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] [2020-12-23 09:37:36,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:37:36,901 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:36,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:36,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1932753182, now seen corresponding path program 1 times [2020-12-23 09:37:36,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:36,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114626985] [2020-12-23 09:37:36,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:36,980 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:36,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114626985] [2020-12-23 09:37:36,981 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:36,981 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:36,981 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819415599] [2020-12-23 09:37:36,984 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:36,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:36,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:36,985 INFO L87 Difference]: Start difference. First operand 2291 states and 3303 transitions. Second operand 4 states. [2020-12-23 09:37:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:37,422 INFO L93 Difference]: Finished difference Result 5497 states and 7921 transitions. [2020-12-23 09:37:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:37,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:37,429 INFO L225 Difference]: With dead ends: 5497 [2020-12-23 09:37:37,429 INFO L226 Difference]: Without dead ends: 3238 [2020-12-23 09:37:37,435 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:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3238 states. [2020-12-23 09:37:37,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3238 to 2291. [2020-12-23 09:37:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3300 transitions. [2020-12-23 09:37:37,604 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3300 transitions. Word has length 145 [2020-12-23 09:37:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:37,605 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3300 transitions. [2020-12-23 09:37:37,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3300 transitions. [2020-12-23 09:37:37,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:37,607 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:37,607 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] [2020-12-23 09:37:37,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:37:37,607 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:37,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:37,608 INFO L82 PathProgramCache]: Analyzing trace with hash 69133088, now seen corresponding path program 1 times [2020-12-23 09:37:37,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:37,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552512471] [2020-12-23 09:37:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:37,679 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:37,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552512471] [2020-12-23 09:37:37,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:37,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:37,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049391110] [2020-12-23 09:37:37,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:37,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:37,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:37,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:37,683 INFO L87 Difference]: Start difference. First operand 2291 states and 3300 transitions. Second operand 4 states. [2020-12-23 09:37:38,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:38,131 INFO L93 Difference]: Finished difference Result 5495 states and 7911 transitions. [2020-12-23 09:37:38,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:38,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:38,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:38,139 INFO L225 Difference]: With dead ends: 5495 [2020-12-23 09:37:38,139 INFO L226 Difference]: Without dead ends: 3237 [2020-12-23 09:37:38,145 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:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3237 states. [2020-12-23 09:37:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3237 to 2291. [2020-12-23 09:37:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:38,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3297 transitions. [2020-12-23 09:37:38,398 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3297 transitions. Word has length 145 [2020-12-23 09:37:38,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:38,399 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3297 transitions. [2020-12-23 09:37:38,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:38,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3297 transitions. [2020-12-23 09:37:38,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:38,401 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:38,401 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] [2020-12-23 09:37:38,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:37:38,402 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:38,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:38,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1796278050, now seen corresponding path program 1 times [2020-12-23 09:37:38,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:38,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182065914] [2020-12-23 09:37:38,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:38,489 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:38,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182065914] [2020-12-23 09:37:38,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:38,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:38,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624454739] [2020-12-23 09:37:38,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:38,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:38,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:38,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:38,494 INFO L87 Difference]: Start difference. First operand 2291 states and 3297 transitions. Second operand 4 states. [2020-12-23 09:37:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:38,981 INFO L93 Difference]: Finished difference Result 5493 states and 7901 transitions. [2020-12-23 09:37:38,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:38,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:38,989 INFO L225 Difference]: With dead ends: 5493 [2020-12-23 09:37:38,989 INFO L226 Difference]: Without dead ends: 3236 [2020-12-23 09:37:38,995 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:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2020-12-23 09:37:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 2291. [2020-12-23 09:37:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3294 transitions. [2020-12-23 09:37:39,207 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3294 transitions. Word has length 145 [2020-12-23 09:37:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:39,208 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3294 transitions. [2020-12-23 09:37:39,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3294 transitions. [2020-12-23 09:37:39,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:39,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:39,210 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] [2020-12-23 09:37:39,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:37:39,210 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:39,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:39,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2027332896, now seen corresponding path program 1 times [2020-12-23 09:37:39,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:39,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060678214] [2020-12-23 09:37:39,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:39,311 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:39,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060678214] [2020-12-23 09:37:39,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:39,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:39,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225847141] [2020-12-23 09:37:39,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:39,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:39,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:39,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:39,314 INFO L87 Difference]: Start difference. First operand 2291 states and 3294 transitions. Second operand 4 states. [2020-12-23 09:37:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:39,806 INFO L93 Difference]: Finished difference Result 5491 states and 7891 transitions. [2020-12-23 09:37:39,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:39,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:39,814 INFO L225 Difference]: With dead ends: 5491 [2020-12-23 09:37:39,814 INFO L226 Difference]: Without dead ends: 3235 [2020-12-23 09:37:39,819 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:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2020-12-23 09:37:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 2291. [2020-12-23 09:37:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2020-12-23 09:37:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3291 transitions. [2020-12-23 09:37:40,041 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3291 transitions. Word has length 145 [2020-12-23 09:37:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:40,042 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 3291 transitions. [2020-12-23 09:37:40,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3291 transitions. [2020-12-23 09:37:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:40,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:40,044 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] [2020-12-23 09:37:40,044 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:37:40,045 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash 620271458, now seen corresponding path program 1 times [2020-12-23 09:37:40,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:40,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252859438] [2020-12-23 09:37:40,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:40,119 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:40,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252859438] [2020-12-23 09:37:40,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:40,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:40,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700879082] [2020-12-23 09:37:40,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:40,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:40,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:40,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:40,124 INFO L87 Difference]: Start difference. First operand 2291 states and 3291 transitions. Second operand 5 states. [2020-12-23 09:37:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:40,776 INFO L93 Difference]: Finished difference Result 7054 states and 10187 transitions. [2020-12-23 09:37:40,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:40,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2020-12-23 09:37:40,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:40,789 INFO L225 Difference]: With dead ends: 7054 [2020-12-23 09:37:40,790 INFO L226 Difference]: Without dead ends: 4805 [2020-12-23 09:37:40,798 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:37:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4805 states. [2020-12-23 09:37:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4805 to 2327. [2020-12-23 09:37:41,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2020-12-23 09:37:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 3315 transitions. [2020-12-23 09:37:41,035 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 3315 transitions. Word has length 145 [2020-12-23 09:37:41,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:41,035 INFO L481 AbstractCegarLoop]: Abstraction has 2327 states and 3315 transitions. [2020-12-23 09:37:41,035 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:41,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 3315 transitions. [2020-12-23 09:37:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:41,037 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:41,037 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] [2020-12-23 09:37:41,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:37:41,038 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:41,038 INFO L82 PathProgramCache]: Analyzing trace with hash 738712932, now seen corresponding path program 1 times [2020-12-23 09:37:41,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:41,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709626869] [2020-12-23 09:37:41,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:41,120 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:41,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709626869] [2020-12-23 09:37:41,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:41,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:41,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785135434] [2020-12-23 09:37:41,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:41,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:41,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:41,126 INFO L87 Difference]: Start difference. First operand 2327 states and 3315 transitions. Second operand 4 states. [2020-12-23 09:37:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:42,022 INFO L93 Difference]: Finished difference Result 8725 states and 12420 transitions. [2020-12-23 09:37:42,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:42,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:42,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:42,041 INFO L225 Difference]: With dead ends: 8725 [2020-12-23 09:37:42,041 INFO L226 Difference]: Without dead ends: 6435 [2020-12-23 09:37:42,049 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:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6435 states. [2020-12-23 09:37:42,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6435 to 6131. [2020-12-23 09:37:42,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6131 states. [2020-12-23 09:37:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6131 states to 6131 states and 8669 transitions. [2020-12-23 09:37:42,841 INFO L78 Accepts]: Start accepts. Automaton has 6131 states and 8669 transitions. Word has length 145 [2020-12-23 09:37:42,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:42,841 INFO L481 AbstractCegarLoop]: Abstraction has 6131 states and 8669 transitions. [2020-12-23 09:37:42,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:42,842 INFO L276 IsEmpty]: Start isEmpty. Operand 6131 states and 8669 transitions. [2020-12-23 09:37:42,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:42,844 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:42,844 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] [2020-12-23 09:37:42,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:37:42,845 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:42,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1240874011, now seen corresponding path program 1 times [2020-12-23 09:37:42,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:42,846 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887918218] [2020-12-23 09:37:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:42,904 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:42,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887918218] [2020-12-23 09:37:42,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:42,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:42,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413800197] [2020-12-23 09:37:42,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:42,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:42,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:42,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:42,910 INFO L87 Difference]: Start difference. First operand 6131 states and 8669 transitions. Second operand 5 states. [2020-12-23 09:37:44,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:44,185 INFO L93 Difference]: Finished difference Result 16199 states and 22969 transitions. [2020-12-23 09:37:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:44,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2020-12-23 09:37:44,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:44,208 INFO L225 Difference]: With dead ends: 16199 [2020-12-23 09:37:44,208 INFO L226 Difference]: Without dead ends: 10115 [2020-12-23 09:37:44,222 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:37:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10115 states. [2020-12-23 09:37:44,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10115 to 6200. [2020-12-23 09:37:44,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6200 states. [2020-12-23 09:37:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6200 states to 6200 states and 8697 transitions. [2020-12-23 09:37:44,949 INFO L78 Accepts]: Start accepts. Automaton has 6200 states and 8697 transitions. Word has length 145 [2020-12-23 09:37:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:44,949 INFO L481 AbstractCegarLoop]: Abstraction has 6200 states and 8697 transitions. [2020-12-23 09:37:44,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 6200 states and 8697 transitions. [2020-12-23 09:37:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:44,951 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:44,951 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] [2020-12-23 09:37:44,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:37:44,952 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:44,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:44,953 INFO L82 PathProgramCache]: Analyzing trace with hash -209833113, now seen corresponding path program 1 times [2020-12-23 09:37:44,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:44,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912665141] [2020-12-23 09:37:44,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:45,022 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:45,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912665141] [2020-12-23 09:37:45,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:45,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:45,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808058282] [2020-12-23 09:37:45,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:45,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:45,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:45,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:45,024 INFO L87 Difference]: Start difference. First operand 6200 states and 8697 transitions. Second operand 5 states. [2020-12-23 09:37:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:45,885 INFO L93 Difference]: Finished difference Result 13559 states and 18980 transitions. [2020-12-23 09:37:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:45,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2020-12-23 09:37:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:45,902 INFO L225 Difference]: With dead ends: 13559 [2020-12-23 09:37:45,902 INFO L226 Difference]: Without dead ends: 7413 [2020-12-23 09:37:45,911 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:37:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7413 states. [2020-12-23 09:37:46,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7413 to 6206. [2020-12-23 09:37:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6206 states. [2020-12-23 09:37:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6206 states to 6206 states and 8641 transitions. [2020-12-23 09:37:46,481 INFO L78 Accepts]: Start accepts. Automaton has 6206 states and 8641 transitions. Word has length 145 [2020-12-23 09:37:46,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:46,481 INFO L481 AbstractCegarLoop]: Abstraction has 6206 states and 8641 transitions. [2020-12-23 09:37:46,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 6206 states and 8641 transitions. [2020-12-23 09:37:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:46,484 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:46,484 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] [2020-12-23 09:37:46,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:37:46,484 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:46,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1093342103, now seen corresponding path program 1 times [2020-12-23 09:37:46,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:46,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404345087] [2020-12-23 09:37:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:46,623 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:46,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404345087] [2020-12-23 09:37:46,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:46,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:46,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918172978] [2020-12-23 09:37:46,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:46,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:46,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:46,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:46,626 INFO L87 Difference]: Start difference. First operand 6206 states and 8641 transitions. Second operand 4 states. [2020-12-23 09:37:48,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:48,264 INFO L93 Difference]: Finished difference Result 23664 states and 32940 transitions. [2020-12-23 09:37:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:48,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:48,291 INFO L225 Difference]: With dead ends: 23664 [2020-12-23 09:37:48,291 INFO L226 Difference]: Without dead ends: 17514 [2020-12-23 09:37:48,301 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:48,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17514 states. [2020-12-23 09:37:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17514 to 16822. [2020-12-23 09:37:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16822 states. [2020-12-23 09:37:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16822 states to 16822 states and 23267 transitions. [2020-12-23 09:37:49,546 INFO L78 Accepts]: Start accepts. Automaton has 16822 states and 23267 transitions. Word has length 145 [2020-12-23 09:37:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:49,547 INFO L481 AbstractCegarLoop]: Abstraction has 16822 states and 23267 transitions. [2020-12-23 09:37:49,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 16822 states and 23267 transitions. [2020-12-23 09:37:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:49,549 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:49,550 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] [2020-12-23 09:37:49,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:37:49,550 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:49,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2040777834, now seen corresponding path program 1 times [2020-12-23 09:37:49,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:49,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409113214] [2020-12-23 09:37:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:49,605 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,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409113214] [2020-12-23 09:37:49,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:49,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:49,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102188471] [2020-12-23 09:37:49,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:49,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:49,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:49,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:49,607 INFO L87 Difference]: Start difference. First operand 16822 states and 23267 transitions. Second operand 5 states. [2020-12-23 09:37:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:51,880 INFO L93 Difference]: Finished difference Result 43757 states and 60865 transitions. [2020-12-23 09:37:51,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:51,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2020-12-23 09:37:51,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:51,908 INFO L225 Difference]: With dead ends: 43757 [2020-12-23 09:37:51,909 INFO L226 Difference]: Without dead ends: 26995 [2020-12-23 09:37:51,927 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:37:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26995 states. [2020-12-23 09:37:53,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26995 to 17011. [2020-12-23 09:37:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17011 states. [2020-12-23 09:37:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17011 states to 17011 states and 23345 transitions. [2020-12-23 09:37:53,424 INFO L78 Accepts]: Start accepts. Automaton has 17011 states and 23345 transitions. Word has length 145 [2020-12-23 09:37:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:53,425 INFO L481 AbstractCegarLoop]: Abstraction has 17011 states and 23345 transitions. [2020-12-23 09:37:53,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 17011 states and 23345 transitions. [2020-12-23 09:37:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:37:53,426 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:53,426 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] [2020-12-23 09:37:53,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:37:53,426 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:53,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:53,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1454501612, now seen corresponding path program 1 times [2020-12-23 09:37:53,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:53,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152609031] [2020-12-23 09:37:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:53,484 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,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152609031] [2020-12-23 09:37:53,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:53,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:53,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028075807] [2020-12-23 09:37:53,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:53,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:53,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:53,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:53,486 INFO L87 Difference]: Start difference. First operand 17011 states and 23345 transitions. Second operand 4 states. [2020-12-23 09:37:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:57,532 INFO L93 Difference]: Finished difference Result 65225 states and 89511 transitions. [2020-12-23 09:37:57,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:57,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:37:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:57,586 INFO L225 Difference]: With dead ends: 65225 [2020-12-23 09:37:57,587 INFO L226 Difference]: Without dead ends: 48276 [2020-12-23 09:37:57,608 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,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48276 states. [2020-12-23 09:38:01,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48276 to 46634. [2020-12-23 09:38:01,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46634 states. [2020-12-23 09:38:01,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46634 states to 46634 states and 63614 transitions. [2020-12-23 09:38:01,913 INFO L78 Accepts]: Start accepts. Automaton has 46634 states and 63614 transitions. Word has length 145 [2020-12-23 09:38:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:01,913 INFO L481 AbstractCegarLoop]: Abstraction has 46634 states and 63614 transitions. [2020-12-23 09:38:01,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 46634 states and 63614 transitions. [2020-12-23 09:38:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:38:01,915 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:01,915 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] [2020-12-23 09:38:01,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:38:01,915 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:01,916 INFO L82 PathProgramCache]: Analyzing trace with hash 237314989, now seen corresponding path program 1 times [2020-12-23 09:38:01,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:01,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733114447] [2020-12-23 09:38:01,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:01,971 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,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733114447] [2020-12-23 09:38:01,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:01,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:38:01,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922849200] [2020-12-23 09:38:01,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:01,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:01,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:01,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:01,974 INFO L87 Difference]: Start difference. First operand 46634 states and 63614 transitions. Second operand 5 states. [2020-12-23 09:38:08,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:08,176 INFO L93 Difference]: Finished difference Result 120338 states and 165261 transitions. [2020-12-23 09:38:08,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:08,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2020-12-23 09:38:08,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:08,275 INFO L225 Difference]: With dead ends: 120338 [2020-12-23 09:38:08,275 INFO L226 Difference]: Without dead ends: 73770 [2020-12-23 09:38:08,318 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,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73770 states. [2020-12-23 09:38:12,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73770 to 47153. [2020-12-23 09:38:12,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47153 states. [2020-12-23 09:38:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47153 states to 47153 states and 63830 transitions. [2020-12-23 09:38:12,863 INFO L78 Accepts]: Start accepts. Automaton has 47153 states and 63830 transitions. Word has length 145 [2020-12-23 09:38:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:12,863 INFO L481 AbstractCegarLoop]: Abstraction has 47153 states and 63830 transitions. [2020-12-23 09:38:12,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:38:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 47153 states and 63830 transitions. [2020-12-23 09:38:12,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:38:12,865 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:12,865 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] [2020-12-23 09:38:12,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:38:12,866 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:12,866 INFO L82 PathProgramCache]: Analyzing trace with hash -820523089, now seen corresponding path program 1 times [2020-12-23 09:38:12,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:12,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610082072] [2020-12-23 09:38:12,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:12,923 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:12,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610082072] [2020-12-23 09:38:12,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:12,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:38:12,926 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211211767] [2020-12-23 09:38:12,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:38:12,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:12,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:38:12,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:38:12,928 INFO L87 Difference]: Start difference. First operand 47153 states and 63830 transitions. Second operand 3 states. [2020-12-23 09:38:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:20,559 INFO L93 Difference]: Finished difference Result 136581 states and 184911 transitions. [2020-12-23 09:38:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:38:20,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2020-12-23 09:38:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:20,673 INFO L225 Difference]: With dead ends: 136581 [2020-12-23 09:38:20,673 INFO L226 Difference]: Without dead ends: 89503 [2020-12-23 09:38:20,717 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:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89503 states. [2020-12-23 09:38:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89503 to 89393. [2020-12-23 09:38:28,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89393 states. [2020-12-23 09:38:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89393 states to 89393 states and 120587 transitions. [2020-12-23 09:38:28,441 INFO L78 Accepts]: Start accepts. Automaton has 89393 states and 120587 transitions. Word has length 145 [2020-12-23 09:38:28,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:28,441 INFO L481 AbstractCegarLoop]: Abstraction has 89393 states and 120587 transitions. [2020-12-23 09:38:28,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:38:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 89393 states and 120587 transitions. [2020-12-23 09:38:28,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:38:28,442 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:28,442 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] [2020-12-23 09:38:28,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 09:38:28,443 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:28,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:28,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1311464944, now seen corresponding path program 1 times [2020-12-23 09:38:28,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:28,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816204837] [2020-12-23 09:38:28,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:28,499 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:28,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816204837] [2020-12-23 09:38:28,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:28,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:38:28,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737250950] [2020-12-23 09:38:28,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:28,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:28,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:28,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:28,501 INFO L87 Difference]: Start difference. First operand 89393 states and 120587 transitions. Second operand 5 states. [2020-12-23 09:38:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:41,914 INFO L93 Difference]: Finished difference Result 247874 states and 337318 transitions. [2020-12-23 09:38:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:41,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2020-12-23 09:38:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:42,298 INFO L225 Difference]: With dead ends: 247874 [2020-12-23 09:38:42,298 INFO L226 Difference]: Without dead ends: 158560 [2020-12-23 09:38:42,369 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:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158560 states. [2020-12-23 09:38:51,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158560 to 90818. [2020-12-23 09:38:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90818 states. [2020-12-23 09:38:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90818 states to 90818 states and 121590 transitions. [2020-12-23 09:38:51,286 INFO L78 Accepts]: Start accepts. Automaton has 90818 states and 121590 transitions. Word has length 145 [2020-12-23 09:38:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:51,286 INFO L481 AbstractCegarLoop]: Abstraction has 90818 states and 121590 transitions. [2020-12-23 09:38:51,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:38:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 90818 states and 121590 transitions. [2020-12-23 09:38:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:38:51,287 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:51,287 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] [2020-12-23 09:38:51,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 09:38:51,288 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:51,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash 818838770, now seen corresponding path program 1 times [2020-12-23 09:38:51,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:51,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111944386] [2020-12-23 09:38:51,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:51,351 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:51,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111944386] [2020-12-23 09:38:51,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:51,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:38:51,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274103645] [2020-12-23 09:38:51,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:51,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:51,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:51,354 INFO L87 Difference]: Start difference. First operand 90818 states and 121590 transitions. Second operand 5 states. [2020-12-23 09:39:10,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:10,552 INFO L93 Difference]: Finished difference Result 308773 states and 418671 transitions. [2020-12-23 09:39:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:39:10,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2020-12-23 09:39:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:11,074 INFO L225 Difference]: With dead ends: 308773 [2020-12-23 09:39:11,074 INFO L226 Difference]: Without dead ends: 218041 [2020-12-23 09:39:11,163 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:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218041 states. [2020-12-23 09:39:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218041 to 93509. [2020-12-23 09:39:21,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93509 states. [2020-12-23 09:39:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93509 states to 93509 states and 124281 transitions. [2020-12-23 09:39:21,300 INFO L78 Accepts]: Start accepts. Automaton has 93509 states and 124281 transitions. Word has length 145 [2020-12-23 09:39:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:21,301 INFO L481 AbstractCegarLoop]: Abstraction has 93509 states and 124281 transitions. [2020-12-23 09:39:21,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:39:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 93509 states and 124281 transitions. [2020-12-23 09:39:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:39:21,302 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:21,302 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] [2020-12-23 09:39:21,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 09:39:21,303 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:39:21,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:21,303 INFO L82 PathProgramCache]: Analyzing trace with hash 401442164, now seen corresponding path program 1 times [2020-12-23 09:39:21,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:21,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859629391] [2020-12-23 09:39:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:21,370 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:21,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859629391] [2020-12-23 09:39:21,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:21,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:39:21,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932303679] [2020-12-23 09:39:21,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:39:21,372 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:21,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:39:21,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:39:21,373 INFO L87 Difference]: Start difference. First operand 93509 states and 124281 transitions. Second operand 4 states. [2020-12-23 09:39:47,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:47,483 INFO L93 Difference]: Finished difference Result 355582 states and 472906 transitions. [2020-12-23 09:39:47,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:39:47,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:39:47,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:48,044 INFO L225 Difference]: With dead ends: 355582 [2020-12-23 09:39:48,044 INFO L226 Difference]: Without dead ends: 262164 [2020-12-23 09:39:48,154 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:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262164 states.