/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/token_ring.13.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:34:56,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:34:56,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:34:56,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:34:56,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:34:56,992 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:34:56,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:34:57,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:34:57,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:34:57,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:34:57,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:34:57,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:34:57,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:34:57,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:34:57,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:34:57,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:34:57,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:34:57,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:34:57,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:34:57,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:34:57,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:34:57,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:34:57,031 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:34:57,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:34:57,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:34:57,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:34:57,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:34:57,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:34:57,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:34:57,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:34:57,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:34:57,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:34:57,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:34:57,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:34:57,054 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:34:57,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:34:57,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:34:57,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:34:57,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:34:57,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:34:57,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:34:57,066 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:34:57,120 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:34:57,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:34:57,122 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:34:57,124 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:34:57,124 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:34:57,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:34:57,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:34:57,125 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:34:57,125 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:34:57,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:34:57,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:34:57,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:34:57,126 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:34:57,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:34:57,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:34:57,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:34:57,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:34:57,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:34:57,128 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:34:57,128 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:34:57,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:34:57,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:34:57,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:34:57,129 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:34:57,129 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:34:57,129 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:34:57,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:34:57,520 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:34:57,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:34:57,524 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:34:57,525 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:34:57,526 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.13.cil-2.c [2020-12-23 09:34:57,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e856e8ffa/9f1b2adfec624438a6af7bd37b35a907/FLAGf357321f2 [2020-12-23 09:34:58,311 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:34:58,311 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-2.c [2020-12-23 09:34:58,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e856e8ffa/9f1b2adfec624438a6af7bd37b35a907/FLAGf357321f2 [2020-12-23 09:34:58,631 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e856e8ffa/9f1b2adfec624438a6af7bd37b35a907 [2020-12-23 09:34:58,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:34:58,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:34:58,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:34:58,647 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:34:58,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:34:58,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:34:58" (1/1) ... [2020-12-23 09:34:58,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b33875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:58, skipping insertion in model container [2020-12-23 09:34:58,655 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:34:58" (1/1) ... [2020-12-23 09:34:58,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:34:58,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:34:58,893 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/token_ring.13.cil-2.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_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~15,] [2020-12-23 09:34:59,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:34:59,231 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:34:59,246 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/token_ring.13.cil-2.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_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~15,] [2020-12-23 09:34:59,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:34:59,366 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:34:59,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:59 WrapperNode [2020-12-23 09:34:59,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:34:59,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:34:59,369 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:34:59,369 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:34:59,379 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:34:59" (1/1) ... [2020-12-23 09:34:59,397 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:34:59" (1/1) ... [2020-12-23 09:34:59,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:34:59,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:34:59,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:34:59,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:34:59,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:59" (1/1) ... [2020-12-23 09:34:59,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:59" (1/1) ... [2020-12-23 09:34:59,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:59" (1/1) ... [2020-12-23 09:34:59,637 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:59" (1/1) ... [2020-12-23 09:34:59,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:59" (1/1) ... [2020-12-23 09:34:59,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:59" (1/1) ... [2020-12-23 09:34:59,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:59" (1/1) ... [2020-12-23 09:34:59,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:34:59,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:34:59,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:34:59,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:34:59,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:59" (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:34:59,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:34:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:34:59,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:34:59,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:35:03,351 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:35:03,351 INFO L299 CfgBuilder]: Removed 620 assume(true) statements. [2020-12-23 09:35:03,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:35:03 BoogieIcfgContainer [2020-12-23 09:35:03,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:35:03,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:35:03,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:35:03,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:35:03,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:34:58" (1/3) ... [2020-12-23 09:35:03,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535e6f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:35:03, skipping insertion in model container [2020-12-23 09:35:03,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:59" (2/3) ... [2020-12-23 09:35:03,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@535e6f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:35:03, skipping insertion in model container [2020-12-23 09:35:03,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:35:03" (3/3) ... [2020-12-23 09:35:03,366 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.13.cil-2.c [2020-12-23 09:35:03,373 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:35:03,379 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:35:03,398 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:35:03,434 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:35:03,434 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:35:03,434 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:35:03,434 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:35:03,435 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:35:03,435 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:35:03,435 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:35:03,435 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:35:03,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states. [2020-12-23 09:35:03,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:03,519 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:03,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:03,521 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:03,528 INFO L82 PathProgramCache]: Analyzing trace with hash 585149193, now seen corresponding path program 1 times [2020-12-23 09:35:03,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:03,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584341757] [2020-12-23 09:35:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:03,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:35:03,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584341757] [2020-12-23 09:35:03,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:03,880 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:03,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045673181] [2020-12-23 09:35:03,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:03,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:03,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:03,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:03,903 INFO L87 Difference]: Start difference. First operand 1989 states. Second operand 3 states. [2020-12-23 09:35:04,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:04,122 INFO L93 Difference]: Finished difference Result 3973 states and 5975 transitions. [2020-12-23 09:35:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:04,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:04,163 INFO L225 Difference]: With dead ends: 3973 [2020-12-23 09:35:04,163 INFO L226 Difference]: Without dead ends: 1985 [2020-12-23 09:35:04,178 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:35:04,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2020-12-23 09:35:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1985. [2020-12-23 09:35:04,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2020-12-23 09:35:04,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2953 transitions. [2020-12-23 09:35:04,351 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2953 transitions. Word has length 171 [2020-12-23 09:35:04,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:04,352 INFO L481 AbstractCegarLoop]: Abstraction has 1985 states and 2953 transitions. [2020-12-23 09:35:04,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2953 transitions. [2020-12-23 09:35:04,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:04,366 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:04,366 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:04,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:35:04,369 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:04,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:04,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1992875143, now seen corresponding path program 1 times [2020-12-23 09:35:04,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:04,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564788423] [2020-12-23 09:35:04,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:04,650 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:35:04,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564788423] [2020-12-23 09:35:04,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:04,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:04,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781253148] [2020-12-23 09:35:04,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:04,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:04,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:04,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:04,660 INFO L87 Difference]: Start difference. First operand 1985 states and 2953 transitions. Second operand 3 states. [2020-12-23 09:35:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:04,806 INFO L93 Difference]: Finished difference Result 3957 states and 5884 transitions. [2020-12-23 09:35:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:04,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:04,823 INFO L225 Difference]: With dead ends: 3957 [2020-12-23 09:35:04,823 INFO L226 Difference]: Without dead ends: 1985 [2020-12-23 09:35:04,829 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:35:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2020-12-23 09:35:04,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1985. [2020-12-23 09:35:04,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2020-12-23 09:35:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2952 transitions. [2020-12-23 09:35:04,942 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2952 transitions. Word has length 171 [2020-12-23 09:35:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:04,944 INFO L481 AbstractCegarLoop]: Abstraction has 1985 states and 2952 transitions. [2020-12-23 09:35:04,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2952 transitions. [2020-12-23 09:35:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:04,948 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:04,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:04,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:35:04,949 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:04,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:04,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1325493253, now seen corresponding path program 1 times [2020-12-23 09:35:04,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:04,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015662279] [2020-12-23 09:35:04,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:05,216 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:35:05,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015662279] [2020-12-23 09:35:05,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:05,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:05,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35546292] [2020-12-23 09:35:05,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:05,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:05,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:05,223 INFO L87 Difference]: Start difference. First operand 1985 states and 2952 transitions. Second operand 3 states. [2020-12-23 09:35:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:05,417 INFO L93 Difference]: Finished difference Result 5667 states and 8402 transitions. [2020-12-23 09:35:05,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:05,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:05,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:05,439 INFO L225 Difference]: With dead ends: 5667 [2020-12-23 09:35:05,440 INFO L226 Difference]: Without dead ends: 3700 [2020-12-23 09:35:05,446 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:35:05,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2020-12-23 09:35:05,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3698. [2020-12-23 09:35:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:05,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5476 transitions. [2020-12-23 09:35:05,616 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5476 transitions. Word has length 171 [2020-12-23 09:35:05,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:05,622 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5476 transitions. [2020-12-23 09:35:05,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5476 transitions. [2020-12-23 09:35:05,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:05,626 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:05,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:05,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:35:05,627 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:05,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:05,628 INFO L82 PathProgramCache]: Analyzing trace with hash 962370689, now seen corresponding path program 1 times [2020-12-23 09:35:05,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:05,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457997438] [2020-12-23 09:35:05,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:05,740 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:35:05,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457997438] [2020-12-23 09:35:05,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:05,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:05,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619875045] [2020-12-23 09:35:05,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:05,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:05,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:05,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:05,743 INFO L87 Difference]: Start difference. First operand 3698 states and 5476 transitions. Second operand 4 states. [2020-12-23 09:35:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:06,107 INFO L93 Difference]: Finished difference Result 9091 states and 13445 transitions. [2020-12-23 09:35:06,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:06,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:06,137 INFO L225 Difference]: With dead ends: 9091 [2020-12-23 09:35:06,138 INFO L226 Difference]: Without dead ends: 5412 [2020-12-23 09:35:06,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:35:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2020-12-23 09:35:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 3698. [2020-12-23 09:35:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5473 transitions. [2020-12-23 09:35:06,366 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5473 transitions. Word has length 171 [2020-12-23 09:35:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:06,367 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5473 transitions. [2020-12-23 09:35:06,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5473 transitions. [2020-12-23 09:35:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:06,370 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:06,370 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:06,370 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:35:06,370 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:06,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:06,371 INFO L82 PathProgramCache]: Analyzing trace with hash -442820989, now seen corresponding path program 1 times [2020-12-23 09:35:06,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:06,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3637801] [2020-12-23 09:35:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:06,476 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:35:06,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3637801] [2020-12-23 09:35:06,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:06,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:06,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138026693] [2020-12-23 09:35:06,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:06,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:06,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:06,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:06,480 INFO L87 Difference]: Start difference. First operand 3698 states and 5473 transitions. Second operand 4 states. [2020-12-23 09:35:06,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:06,882 INFO L93 Difference]: Finished difference Result 9089 states and 13435 transitions. [2020-12-23 09:35:06,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:06,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:06,913 INFO L225 Difference]: With dead ends: 9089 [2020-12-23 09:35:06,914 INFO L226 Difference]: Without dead ends: 5411 [2020-12-23 09:35:06,922 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:35:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2020-12-23 09:35:07,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 3698. [2020-12-23 09:35:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:07,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5470 transitions. [2020-12-23 09:35:07,150 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5470 transitions. Word has length 171 [2020-12-23 09:35:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:07,150 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5470 transitions. [2020-12-23 09:35:07,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5470 transitions. [2020-12-23 09:35:07,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:07,153 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:07,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:07,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:35:07,153 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:07,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:07,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1451512897, now seen corresponding path program 1 times [2020-12-23 09:35:07,154 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:07,154 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134143029] [2020-12-23 09:35:07,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:07,287 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:35:07,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134143029] [2020-12-23 09:35:07,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:07,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:07,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710000626] [2020-12-23 09:35:07,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:07,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:07,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:07,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:07,290 INFO L87 Difference]: Start difference. First operand 3698 states and 5470 transitions. Second operand 3 states. [2020-12-23 09:35:07,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:07,521 INFO L93 Difference]: Finished difference Result 7374 states and 10904 transitions. [2020-12-23 09:35:07,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:07,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:07,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:07,540 INFO L225 Difference]: With dead ends: 7374 [2020-12-23 09:35:07,540 INFO L226 Difference]: Without dead ends: 3698 [2020-12-23 09:35:07,547 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:35:07,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2020-12-23 09:35:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2020-12-23 09:35:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5462 transitions. [2020-12-23 09:35:07,758 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5462 transitions. Word has length 171 [2020-12-23 09:35:07,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:07,759 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5462 transitions. [2020-12-23 09:35:07,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:07,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5462 transitions. [2020-12-23 09:35:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:07,761 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:07,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:07,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:35:07,762 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:07,768 INFO L82 PathProgramCache]: Analyzing trace with hash -501013827, now seen corresponding path program 1 times [2020-12-23 09:35:07,768 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:07,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103956311] [2020-12-23 09:35:07,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:07,887 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:35:07,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103956311] [2020-12-23 09:35:07,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:07,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:07,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329089858] [2020-12-23 09:35:07,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:07,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:07,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:07,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:07,892 INFO L87 Difference]: Start difference. First operand 3698 states and 5462 transitions. Second operand 3 states. [2020-12-23 09:35:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:08,095 INFO L93 Difference]: Finished difference Result 7373 states and 10887 transitions. [2020-12-23 09:35:08,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:08,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:08,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:08,126 INFO L225 Difference]: With dead ends: 7373 [2020-12-23 09:35:08,126 INFO L226 Difference]: Without dead ends: 3698 [2020-12-23 09:35:08,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:08,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2020-12-23 09:35:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2020-12-23 09:35:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5454 transitions. [2020-12-23 09:35:08,337 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5454 transitions. Word has length 171 [2020-12-23 09:35:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:08,337 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5454 transitions. [2020-12-23 09:35:08,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5454 transitions. [2020-12-23 09:35:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:08,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:08,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, 1, 1, 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:35:08,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:35:08,340 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:08,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash 544380097, now seen corresponding path program 1 times [2020-12-23 09:35:08,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:08,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825679291] [2020-12-23 09:35:08,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:08,436 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:35:08,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825679291] [2020-12-23 09:35:08,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:08,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:08,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641594469] [2020-12-23 09:35:08,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:08,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:08,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:08,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:08,439 INFO L87 Difference]: Start difference. First operand 3698 states and 5454 transitions. Second operand 4 states. [2020-12-23 09:35:08,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:08,793 INFO L93 Difference]: Finished difference Result 9081 states and 13379 transitions. [2020-12-23 09:35:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:08,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:08,807 INFO L225 Difference]: With dead ends: 9081 [2020-12-23 09:35:08,807 INFO L226 Difference]: Without dead ends: 5407 [2020-12-23 09:35:08,814 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:35:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5407 states. [2020-12-23 09:35:09,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5407 to 3698. [2020-12-23 09:35:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5451 transitions. [2020-12-23 09:35:09,029 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5451 transitions. Word has length 171 [2020-12-23 09:35:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:09,030 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5451 transitions. [2020-12-23 09:35:09,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5451 transitions. [2020-12-23 09:35:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:09,032 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:09,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:09,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:35:09,033 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:09,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash 279732607, now seen corresponding path program 1 times [2020-12-23 09:35:09,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:09,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112860999] [2020-12-23 09:35:09,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:09,106 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:35:09,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112860999] [2020-12-23 09:35:09,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:09,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:09,113 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187295893] [2020-12-23 09:35:09,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:09,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:09,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:09,115 INFO L87 Difference]: Start difference. First operand 3698 states and 5451 transitions. Second operand 4 states. [2020-12-23 09:35:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:09,495 INFO L93 Difference]: Finished difference Result 9079 states and 13369 transitions. [2020-12-23 09:35:09,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:09,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:09,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:09,511 INFO L225 Difference]: With dead ends: 9079 [2020-12-23 09:35:09,511 INFO L226 Difference]: Without dead ends: 5406 [2020-12-23 09:35:09,518 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:35:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2020-12-23 09:35:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 3698. [2020-12-23 09:35:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5448 transitions. [2020-12-23 09:35:09,742 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5448 transitions. Word has length 171 [2020-12-23 09:35:09,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:09,746 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5448 transitions. [2020-12-23 09:35:09,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:09,746 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5448 transitions. [2020-12-23 09:35:09,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:09,749 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:09,749 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:09,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:35:09,749 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:09,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:09,750 INFO L82 PathProgramCache]: Analyzing trace with hash -2084109055, now seen corresponding path program 1 times [2020-12-23 09:35:09,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:09,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635772516] [2020-12-23 09:35:09,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:09,853 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:35:09,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635772516] [2020-12-23 09:35:09,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:09,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:09,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768849679] [2020-12-23 09:35:09,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:09,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:09,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:09,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:09,855 INFO L87 Difference]: Start difference. First operand 3698 states and 5448 transitions. Second operand 4 states. [2020-12-23 09:35:10,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:10,306 INFO L93 Difference]: Finished difference Result 9077 states and 13359 transitions. [2020-12-23 09:35:10,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:10,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:10,320 INFO L225 Difference]: With dead ends: 9077 [2020-12-23 09:35:10,320 INFO L226 Difference]: Without dead ends: 5405 [2020-12-23 09:35:10,329 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:35:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2020-12-23 09:35:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 3698. [2020-12-23 09:35:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:10,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5445 transitions. [2020-12-23 09:35:10,574 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5445 transitions. Word has length 171 [2020-12-23 09:35:10,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:10,574 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5445 transitions. [2020-12-23 09:35:10,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:10,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5445 transitions. [2020-12-23 09:35:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:10,577 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:10,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:10,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:35:10,577 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:10,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash 887679295, now seen corresponding path program 1 times [2020-12-23 09:35:10,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:10,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268683675] [2020-12-23 09:35:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:10,652 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:35:10,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268683675] [2020-12-23 09:35:10,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:10,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:10,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114536097] [2020-12-23 09:35:10,654 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:10,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:10,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:10,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:10,656 INFO L87 Difference]: Start difference. First operand 3698 states and 5445 transitions. Second operand 4 states. [2020-12-23 09:35:11,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:11,035 INFO L93 Difference]: Finished difference Result 9075 states and 13349 transitions. [2020-12-23 09:35:11,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:11,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:11,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:11,049 INFO L225 Difference]: With dead ends: 9075 [2020-12-23 09:35:11,049 INFO L226 Difference]: Without dead ends: 5404 [2020-12-23 09:35:11,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:11,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2020-12-23 09:35:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 3698. [2020-12-23 09:35:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5442 transitions. [2020-12-23 09:35:11,282 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5442 transitions. Word has length 171 [2020-12-23 09:35:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:11,282 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5442 transitions. [2020-12-23 09:35:11,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5442 transitions. [2020-12-23 09:35:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:11,285 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:11,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:11,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:35:11,286 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:11,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:11,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1510308543, now seen corresponding path program 1 times [2020-12-23 09:35:11,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:11,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275488622] [2020-12-23 09:35:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:11,375 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:35:11,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275488622] [2020-12-23 09:35:11,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:11,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:11,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468803560] [2020-12-23 09:35:11,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:11,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:11,378 INFO L87 Difference]: Start difference. First operand 3698 states and 5442 transitions. Second operand 3 states. [2020-12-23 09:35:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:11,591 INFO L93 Difference]: Finished difference Result 7368 states and 10842 transitions. [2020-12-23 09:35:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:11,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:11,600 INFO L225 Difference]: With dead ends: 7368 [2020-12-23 09:35:11,600 INFO L226 Difference]: Without dead ends: 3698 [2020-12-23 09:35:11,606 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:35:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2020-12-23 09:35:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2020-12-23 09:35:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5434 transitions. [2020-12-23 09:35:11,809 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5434 transitions. Word has length 171 [2020-12-23 09:35:11,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:11,810 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5434 transitions. [2020-12-23 09:35:11,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5434 transitions. [2020-12-23 09:35:11,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:11,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:11,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:11,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:35:11,812 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:11,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:11,813 INFO L82 PathProgramCache]: Analyzing trace with hash -897261379, now seen corresponding path program 1 times [2020-12-23 09:35:11,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:11,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359897113] [2020-12-23 09:35:11,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:11,886 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:35:11,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359897113] [2020-12-23 09:35:11,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:11,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:11,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699176757] [2020-12-23 09:35:11,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:11,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:11,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:11,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:11,889 INFO L87 Difference]: Start difference. First operand 3698 states and 5434 transitions. Second operand 4 states. [2020-12-23 09:35:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:12,277 INFO L93 Difference]: Finished difference Result 9069 states and 13314 transitions. [2020-12-23 09:35:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:12,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:12,289 INFO L225 Difference]: With dead ends: 9069 [2020-12-23 09:35:12,289 INFO L226 Difference]: Without dead ends: 5401 [2020-12-23 09:35:12,295 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:35:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2020-12-23 09:35:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 3698. [2020-12-23 09:35:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5431 transitions. [2020-12-23 09:35:12,511 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5431 transitions. Word has length 171 [2020-12-23 09:35:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:12,511 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5431 transitions. [2020-12-23 09:35:12,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5431 transitions. [2020-12-23 09:35:12,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:12,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:12,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:12,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:35:12,514 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:12,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:12,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1437690885, now seen corresponding path program 1 times [2020-12-23 09:35:12,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:12,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385687799] [2020-12-23 09:35:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:12,580 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:35:12,580 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385687799] [2020-12-23 09:35:12,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:12,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:12,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206642232] [2020-12-23 09:35:12,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:12,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:12,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:12,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:12,582 INFO L87 Difference]: Start difference. First operand 3698 states and 5431 transitions. Second operand 3 states. [2020-12-23 09:35:12,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:12,860 INFO L93 Difference]: Finished difference Result 7365 states and 10816 transitions. [2020-12-23 09:35:12,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:12,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:12,872 INFO L225 Difference]: With dead ends: 7365 [2020-12-23 09:35:12,873 INFO L226 Difference]: Without dead ends: 3698 [2020-12-23 09:35:12,883 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:35:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2020-12-23 09:35:13,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2020-12-23 09:35:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5423 transitions. [2020-12-23 09:35:13,230 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5423 transitions. Word has length 171 [2020-12-23 09:35:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:13,230 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5423 transitions. [2020-12-23 09:35:13,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5423 transitions. [2020-12-23 09:35:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:13,233 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:13,233 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:13,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:35:13,233 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:13,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:13,234 INFO L82 PathProgramCache]: Analyzing trace with hash -207468033, now seen corresponding path program 1 times [2020-12-23 09:35:13,234 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:13,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367274788] [2020-12-23 09:35:13,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:13,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:35:13,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367274788] [2020-12-23 09:35:13,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:13,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:13,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369849810] [2020-12-23 09:35:13,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:13,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:13,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:13,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:13,353 INFO L87 Difference]: Start difference. First operand 3698 states and 5423 transitions. Second operand 4 states. [2020-12-23 09:35:13,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:13,845 INFO L93 Difference]: Finished difference Result 8967 states and 13143 transitions. [2020-12-23 09:35:13,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:13,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:13,859 INFO L225 Difference]: With dead ends: 8967 [2020-12-23 09:35:13,859 INFO L226 Difference]: Without dead ends: 5301 [2020-12-23 09:35:13,868 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:35:13,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2020-12-23 09:35:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 3698. [2020-12-23 09:35:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:14,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5420 transitions. [2020-12-23 09:35:14,142 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5420 transitions. Word has length 171 [2020-12-23 09:35:14,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:14,143 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5420 transitions. [2020-12-23 09:35:14,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:14,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5420 transitions. [2020-12-23 09:35:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:14,145 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:14,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:14,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:35:14,146 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:14,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:14,146 INFO L82 PathProgramCache]: Analyzing trace with hash 203142333, now seen corresponding path program 1 times [2020-12-23 09:35:14,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:14,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2282449] [2020-12-23 09:35:14,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:14,211 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:35:14,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2282449] [2020-12-23 09:35:14,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:14,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:14,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474802188] [2020-12-23 09:35:14,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:14,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:14,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:14,214 INFO L87 Difference]: Start difference. First operand 3698 states and 5420 transitions. Second operand 4 states. [2020-12-23 09:35:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:14,724 INFO L93 Difference]: Finished difference Result 8965 states and 13133 transitions. [2020-12-23 09:35:14,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:14,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:14,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:14,737 INFO L225 Difference]: With dead ends: 8965 [2020-12-23 09:35:14,737 INFO L226 Difference]: Without dead ends: 5300 [2020-12-23 09:35:14,745 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:35:14,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2020-12-23 09:35:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 3698. [2020-12-23 09:35:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5417 transitions. [2020-12-23 09:35:15,040 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5417 transitions. Word has length 171 [2020-12-23 09:35:15,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:15,040 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5417 transitions. [2020-12-23 09:35:15,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5417 transitions. [2020-12-23 09:35:15,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:15,042 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:15,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:15,043 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:35:15,043 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:15,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:15,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1584727489, now seen corresponding path program 1 times [2020-12-23 09:35:15,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:15,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354279661] [2020-12-23 09:35:15,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:15,105 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:35:15,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354279661] [2020-12-23 09:35:15,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:15,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:15,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65482971] [2020-12-23 09:35:15,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:15,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:15,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:15,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:15,107 INFO L87 Difference]: Start difference. First operand 3698 states and 5417 transitions. Second operand 3 states. [2020-12-23 09:35:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:15,387 INFO L93 Difference]: Finished difference Result 7362 states and 10785 transitions. [2020-12-23 09:35:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:15,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:15,395 INFO L225 Difference]: With dead ends: 7362 [2020-12-23 09:35:15,396 INFO L226 Difference]: Without dead ends: 3698 [2020-12-23 09:35:15,401 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:35:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2020-12-23 09:35:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2020-12-23 09:35:15,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5379 transitions. [2020-12-23 09:35:15,639 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5379 transitions. Word has length 171 [2020-12-23 09:35:15,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:15,639 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5379 transitions. [2020-12-23 09:35:15,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:15,640 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5379 transitions. [2020-12-23 09:35:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:15,642 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:15,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:15,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:35:15,642 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:15,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:15,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1653021692, now seen corresponding path program 1 times [2020-12-23 09:35:15,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:15,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700612187] [2020-12-23 09:35:15,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:15,738 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:35:15,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700612187] [2020-12-23 09:35:15,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:15,739 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:15,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708392305] [2020-12-23 09:35:15,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:15,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:15,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:15,743 INFO L87 Difference]: Start difference. First operand 3698 states and 5379 transitions. Second operand 4 states. [2020-12-23 09:35:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:16,261 INFO L93 Difference]: Finished difference Result 8961 states and 13029 transitions. [2020-12-23 09:35:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:16,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:16,273 INFO L225 Difference]: With dead ends: 8961 [2020-12-23 09:35:16,274 INFO L226 Difference]: Without dead ends: 5298 [2020-12-23 09:35:16,281 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:35:16,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2020-12-23 09:35:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 3698. [2020-12-23 09:35:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5376 transitions. [2020-12-23 09:35:16,548 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5376 transitions. Word has length 171 [2020-12-23 09:35:16,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:16,548 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5376 transitions. [2020-12-23 09:35:16,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:16,548 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5376 transitions. [2020-12-23 09:35:16,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:16,550 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:16,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, 1, 1, 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:35:16,551 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:35:16,551 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:16,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:16,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1722669566, now seen corresponding path program 1 times [2020-12-23 09:35:16,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:16,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693158156] [2020-12-23 09:35:16,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:16,646 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:35:16,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693158156] [2020-12-23 09:35:16,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:16,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:16,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126458306] [2020-12-23 09:35:16,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:16,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:16,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:16,648 INFO L87 Difference]: Start difference. First operand 3698 states and 5376 transitions. Second operand 4 states. [2020-12-23 09:35:17,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:17,287 INFO L93 Difference]: Finished difference Result 8959 states and 13019 transitions. [2020-12-23 09:35:17,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:17,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:17,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:17,299 INFO L225 Difference]: With dead ends: 8959 [2020-12-23 09:35:17,300 INFO L226 Difference]: Without dead ends: 5297 [2020-12-23 09:35:17,306 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:35:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2020-12-23 09:35:17,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 3698. [2020-12-23 09:35:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5373 transitions. [2020-12-23 09:35:17,643 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5373 transitions. Word has length 171 [2020-12-23 09:35:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:17,643 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5373 transitions. [2020-12-23 09:35:17,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5373 transitions. [2020-12-23 09:35:17,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:17,646 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:17,646 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:17,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:35:17,646 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:17,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:17,647 INFO L82 PathProgramCache]: Analyzing trace with hash 2140558268, now seen corresponding path program 1 times [2020-12-23 09:35:17,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:17,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481996806] [2020-12-23 09:35:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:17,710 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:35:17,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481996806] [2020-12-23 09:35:17,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:17,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:17,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671745581] [2020-12-23 09:35:17,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:17,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:17,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:17,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:17,713 INFO L87 Difference]: Start difference. First operand 3698 states and 5373 transitions. Second operand 4 states. [2020-12-23 09:35:18,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:18,232 INFO L93 Difference]: Finished difference Result 8955 states and 13005 transitions. [2020-12-23 09:35:18,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:18,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:18,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:18,240 INFO L225 Difference]: With dead ends: 8955 [2020-12-23 09:35:18,240 INFO L226 Difference]: Without dead ends: 5295 [2020-12-23 09:35:18,245 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:35:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2020-12-23 09:35:18,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 3698. [2020-12-23 09:35:18,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5370 transitions. [2020-12-23 09:35:18,527 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5370 transitions. Word has length 171 [2020-12-23 09:35:18,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:18,528 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5370 transitions. [2020-12-23 09:35:18,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5370 transitions. [2020-12-23 09:35:18,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:18,529 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:18,529 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:18,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:35:18,529 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:18,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:18,530 INFO L82 PathProgramCache]: Analyzing trace with hash 523117818, now seen corresponding path program 1 times [2020-12-23 09:35:18,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:18,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592456615] [2020-12-23 09:35:18,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:18,594 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:35:18,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592456615] [2020-12-23 09:35:18,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:18,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:18,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574184370] [2020-12-23 09:35:18,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:18,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:18,597 INFO L87 Difference]: Start difference. First operand 3698 states and 5370 transitions. Second operand 4 states. [2020-12-23 09:35:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:19,059 INFO L93 Difference]: Finished difference Result 8953 states and 12995 transitions. [2020-12-23 09:35:19,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:19,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:19,070 INFO L225 Difference]: With dead ends: 8953 [2020-12-23 09:35:19,070 INFO L226 Difference]: Without dead ends: 5294 [2020-12-23 09:35:19,076 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:35:19,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2020-12-23 09:35:19,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 3698. [2020-12-23 09:35:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:19,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5367 transitions. [2020-12-23 09:35:19,432 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5367 transitions. Word has length 171 [2020-12-23 09:35:19,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:19,433 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5367 transitions. [2020-12-23 09:35:19,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:19,433 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5367 transitions. [2020-12-23 09:35:19,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:19,434 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:19,434 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:19,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:35:19,435 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:19,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:19,435 INFO L82 PathProgramCache]: Analyzing trace with hash 886584316, now seen corresponding path program 1 times [2020-12-23 09:35:19,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:19,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575346419] [2020-12-23 09:35:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:19,528 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:35:19,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575346419] [2020-12-23 09:35:19,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:19,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:19,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253064532] [2020-12-23 09:35:19,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:19,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:19,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:19,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:19,531 INFO L87 Difference]: Start difference. First operand 3698 states and 5367 transitions. Second operand 4 states. [2020-12-23 09:35:19,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:19,970 INFO L93 Difference]: Finished difference Result 8951 states and 12985 transitions. [2020-12-23 09:35:19,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:19,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:19,983 INFO L225 Difference]: With dead ends: 8951 [2020-12-23 09:35:19,983 INFO L226 Difference]: Without dead ends: 5293 [2020-12-23 09:35:19,989 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:35:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2020-12-23 09:35:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 3698. [2020-12-23 09:35:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5364 transitions. [2020-12-23 09:35:20,294 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5364 transitions. Word has length 171 [2020-12-23 09:35:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:20,294 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5364 transitions. [2020-12-23 09:35:20,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5364 transitions. [2020-12-23 09:35:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:20,296 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:20,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:20,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:35:20,296 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:20,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:20,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1175403706, now seen corresponding path program 1 times [2020-12-23 09:35:20,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:20,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865966245] [2020-12-23 09:35:20,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:20,396 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:35:20,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865966245] [2020-12-23 09:35:20,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:20,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:20,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397946395] [2020-12-23 09:35:20,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:20,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:20,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:20,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:20,401 INFO L87 Difference]: Start difference. First operand 3698 states and 5364 transitions. Second operand 4 states. [2020-12-23 09:35:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:20,864 INFO L93 Difference]: Finished difference Result 8949 states and 12975 transitions. [2020-12-23 09:35:20,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:20,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:20,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:20,869 INFO L225 Difference]: With dead ends: 8949 [2020-12-23 09:35:20,869 INFO L226 Difference]: Without dead ends: 5292 [2020-12-23 09:35:20,874 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:35:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2020-12-23 09:35:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 3698. [2020-12-23 09:35:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:21,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5361 transitions. [2020-12-23 09:35:21,108 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5361 transitions. Word has length 171 [2020-12-23 09:35:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:21,108 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5361 transitions. [2020-12-23 09:35:21,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:21,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5361 transitions. [2020-12-23 09:35:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:21,109 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:21,109 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:21,109 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:35:21,110 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash 630531132, now seen corresponding path program 1 times [2020-12-23 09:35:21,110 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:21,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368043744] [2020-12-23 09:35:21,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:21,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:35:21,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368043744] [2020-12-23 09:35:21,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:21,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:21,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036284772] [2020-12-23 09:35:21,183 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:21,183 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:21,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:21,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:21,184 INFO L87 Difference]: Start difference. First operand 3698 states and 5361 transitions. Second operand 4 states. [2020-12-23 09:35:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:21,804 INFO L93 Difference]: Finished difference Result 8947 states and 12965 transitions. [2020-12-23 09:35:21,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:21,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:21,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:21,811 INFO L225 Difference]: With dead ends: 8947 [2020-12-23 09:35:21,811 INFO L226 Difference]: Without dead ends: 5291 [2020-12-23 09:35:21,816 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:35:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2020-12-23 09:35:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 3698. [2020-12-23 09:35:22,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:22,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5358 transitions. [2020-12-23 09:35:22,111 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5358 transitions. Word has length 171 [2020-12-23 09:35:22,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:22,112 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5358 transitions. [2020-12-23 09:35:22,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5358 transitions. [2020-12-23 09:35:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:22,113 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:22,113 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:22,113 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:35:22,113 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:22,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:22,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1305691258, now seen corresponding path program 1 times [2020-12-23 09:35:22,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:22,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479684414] [2020-12-23 09:35:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:22,178 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:35:22,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479684414] [2020-12-23 09:35:22,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:22,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:22,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608182987] [2020-12-23 09:35:22,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:22,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:22,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:22,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:22,180 INFO L87 Difference]: Start difference. First operand 3698 states and 5358 transitions. Second operand 4 states. [2020-12-23 09:35:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:22,639 INFO L93 Difference]: Finished difference Result 8945 states and 12955 transitions. [2020-12-23 09:35:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:22,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:22,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:22,645 INFO L225 Difference]: With dead ends: 8945 [2020-12-23 09:35:22,645 INFO L226 Difference]: Without dead ends: 5290 [2020-12-23 09:35:22,649 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:35:22,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2020-12-23 09:35:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 3698. [2020-12-23 09:35:22,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5355 transitions. [2020-12-23 09:35:22,907 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5355 transitions. Word has length 171 [2020-12-23 09:35:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:22,907 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5355 transitions. [2020-12-23 09:35:22,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:22,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5355 transitions. [2020-12-23 09:35:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:22,908 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:22,909 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:22,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:35:22,909 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash 357639292, now seen corresponding path program 1 times [2020-12-23 09:35:22,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:22,910 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055812921] [2020-12-23 09:35:22,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:22,983 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:35:22,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055812921] [2020-12-23 09:35:22,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:22,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:22,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844005252] [2020-12-23 09:35:22,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:22,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:22,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:22,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:22,986 INFO L87 Difference]: Start difference. First operand 3698 states and 5355 transitions. Second operand 3 states. [2020-12-23 09:35:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:23,313 INFO L93 Difference]: Finished difference Result 7352 states and 10650 transitions. [2020-12-23 09:35:23,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:23,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:23,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:23,318 INFO L225 Difference]: With dead ends: 7352 [2020-12-23 09:35:23,318 INFO L226 Difference]: Without dead ends: 3698 [2020-12-23 09:35:23,323 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:35:23,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2020-12-23 09:35:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2020-12-23 09:35:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2020-12-23 09:35:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5317 transitions. [2020-12-23 09:35:23,544 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5317 transitions. Word has length 171 [2020-12-23 09:35:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:23,544 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5317 transitions. [2020-12-23 09:35:23,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5317 transitions. [2020-12-23 09:35:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:23,545 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:23,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:35:23,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:35:23,545 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1248200712, now seen corresponding path program 1 times [2020-12-23 09:35:23,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:23,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031611304] [2020-12-23 09:35:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:23,611 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:35:23,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031611304] [2020-12-23 09:35:23,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:23,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:23,612 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827968186] [2020-12-23 09:35:23,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:23,613 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:23,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:23,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:23,613 INFO L87 Difference]: Start difference. First operand 3698 states and 5317 transitions. Second operand 3 states. [2020-12-23 09:35:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:24,213 INFO L93 Difference]: Finished difference Result 10838 states and 15566 transitions. [2020-12-23 09:35:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:24,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:24,220 INFO L225 Difference]: With dead ends: 10838 [2020-12-23 09:35:24,221 INFO L226 Difference]: Without dead ends: 7187 [2020-12-23 09:35:24,226 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:35:24,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2020-12-23 09:35:24,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 6995. [2020-12-23 09:35:24,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6995 states. [2020-12-23 09:35:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 10011 transitions. [2020-12-23 09:35:24,681 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 10011 transitions. Word has length 171 [2020-12-23 09:35:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:24,681 INFO L481 AbstractCegarLoop]: Abstraction has 6995 states and 10011 transitions. [2020-12-23 09:35:24,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 10011 transitions. [2020-12-23 09:35:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:24,686 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:24,687 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:24,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:35:24,687 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:24,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:24,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1031873080, now seen corresponding path program 1 times [2020-12-23 09:35:24,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:24,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78076825] [2020-12-23 09:35:24,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:35:24,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78076825] [2020-12-23 09:35:24,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:24,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:24,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437634008] [2020-12-23 09:35:24,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:24,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:24,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:24,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:24,795 INFO L87 Difference]: Start difference. First operand 6995 states and 10011 transitions. Second operand 5 states. [2020-12-23 09:35:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:26,463 INFO L93 Difference]: Finished difference Result 20722 states and 29666 transitions. [2020-12-23 09:35:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:26,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:26,476 INFO L225 Difference]: With dead ends: 20722 [2020-12-23 09:35:26,476 INFO L226 Difference]: Without dead ends: 13778 [2020-12-23 09:35:26,484 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:35:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2020-12-23 09:35:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 7088. [2020-12-23 09:35:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7088 states. [2020-12-23 09:35:27,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 10074 transitions. [2020-12-23 09:35:27,076 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 10074 transitions. Word has length 279 [2020-12-23 09:35:27,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:27,076 INFO L481 AbstractCegarLoop]: Abstraction has 7088 states and 10074 transitions. [2020-12-23 09:35:27,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 10074 transitions. [2020-12-23 09:35:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:27,082 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:27,082 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:27,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:35:27,082 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash -2102224180, now seen corresponding path program 1 times [2020-12-23 09:35:27,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:27,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564670758] [2020-12-23 09:35:27,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:35:27,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564670758] [2020-12-23 09:35:27,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:27,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:27,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556711801] [2020-12-23 09:35:27,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:27,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:27,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:27,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:27,189 INFO L87 Difference]: Start difference. First operand 7088 states and 10074 transitions. Second operand 5 states. [2020-12-23 09:35:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:28,373 INFO L93 Difference]: Finished difference Result 16803 states and 23876 transitions. [2020-12-23 09:35:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:28,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:28,382 INFO L225 Difference]: With dead ends: 16803 [2020-12-23 09:35:28,382 INFO L226 Difference]: Without dead ends: 9780 [2020-12-23 09:35:28,390 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:35:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2020-12-23 09:35:28,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 7100. [2020-12-23 09:35:28,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7100 states. [2020-12-23 09:35:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7100 states to 7100 states and 10029 transitions. [2020-12-23 09:35:28,922 INFO L78 Accepts]: Start accepts. Automaton has 7100 states and 10029 transitions. Word has length 279 [2020-12-23 09:35:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:28,922 INFO L481 AbstractCegarLoop]: Abstraction has 7100 states and 10029 transitions. [2020-12-23 09:35:28,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 7100 states and 10029 transitions. [2020-12-23 09:35:28,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:28,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:28,928 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:28,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:35:28,929 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:28,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:28,929 INFO L82 PathProgramCache]: Analyzing trace with hash -453591600, now seen corresponding path program 1 times [2020-12-23 09:35:28,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:28,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814329894] [2020-12-23 09:35:28,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:35:29,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814329894] [2020-12-23 09:35:29,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:29,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:29,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876403852] [2020-12-23 09:35:29,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:29,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:29,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:29,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:29,033 INFO L87 Difference]: Start difference. First operand 7100 states and 10029 transitions. Second operand 5 states. [2020-12-23 09:35:30,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:30,848 INFO L93 Difference]: Finished difference Result 26309 states and 37316 transitions. [2020-12-23 09:35:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:30,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:30,865 INFO L225 Difference]: With dead ends: 26309 [2020-12-23 09:35:30,865 INFO L226 Difference]: Without dead ends: 19281 [2020-12-23 09:35:30,873 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:35:30,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19281 states. [2020-12-23 09:35:31,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19281 to 7283. [2020-12-23 09:35:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7283 states. [2020-12-23 09:35:31,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 10212 transitions. [2020-12-23 09:35:31,575 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 10212 transitions. Word has length 279 [2020-12-23 09:35:31,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:31,575 INFO L481 AbstractCegarLoop]: Abstraction has 7283 states and 10212 transitions. [2020-12-23 09:35:31,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:31,575 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 10212 transitions. [2020-12-23 09:35:31,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:31,581 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:31,581 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:31,581 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 09:35:31,581 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:31,582 INFO L82 PathProgramCache]: Analyzing trace with hash -323727022, now seen corresponding path program 1 times [2020-12-23 09:35:31,582 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:31,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476851345] [2020-12-23 09:35:31,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:31,700 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:35:31,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476851345] [2020-12-23 09:35:31,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:31,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:31,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821491107] [2020-12-23 09:35:31,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:31,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:31,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:31,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:31,702 INFO L87 Difference]: Start difference. First operand 7283 states and 10212 transitions. Second operand 4 states. [2020-12-23 09:35:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:33,620 INFO L93 Difference]: Finished difference Result 24760 states and 34665 transitions. [2020-12-23 09:35:33,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:33,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2020-12-23 09:35:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:33,639 INFO L225 Difference]: With dead ends: 24760 [2020-12-23 09:35:33,639 INFO L226 Difference]: Without dead ends: 17554 [2020-12-23 09:35:33,648 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:35:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17554 states. [2020-12-23 09:35:34,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17554 to 13914. [2020-12-23 09:35:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13914 states. [2020-12-23 09:35:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13914 states to 13914 states and 19432 transitions. [2020-12-23 09:35:34,951 INFO L78 Accepts]: Start accepts. Automaton has 13914 states and 19432 transitions. Word has length 279 [2020-12-23 09:35:34,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:34,951 INFO L481 AbstractCegarLoop]: Abstraction has 13914 states and 19432 transitions. [2020-12-23 09:35:34,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:34,951 INFO L276 IsEmpty]: Start isEmpty. Operand 13914 states and 19432 transitions. [2020-12-23 09:35:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:34,959 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:34,959 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:34,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 09:35:34,960 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:34,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1100677485, now seen corresponding path program 1 times [2020-12-23 09:35:34,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:34,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482260823] [2020-12-23 09:35:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:35:35,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482260823] [2020-12-23 09:35:35,063 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:35,063 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:35,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116279631] [2020-12-23 09:35:35,064 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:35,064 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:35,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:35,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:35,064 INFO L87 Difference]: Start difference. First operand 13914 states and 19432 transitions. Second operand 5 states. [2020-12-23 09:35:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:37,663 INFO L93 Difference]: Finished difference Result 39489 states and 55392 transitions. [2020-12-23 09:35:37,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:37,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:37,690 INFO L225 Difference]: With dead ends: 39489 [2020-12-23 09:35:37,690 INFO L226 Difference]: Without dead ends: 25656 [2020-12-23 09:35:37,705 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:35:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25656 states. [2020-12-23 09:35:39,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25656 to 14094. [2020-12-23 09:35:39,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14094 states. [2020-12-23 09:35:39,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14094 states to 14094 states and 19555 transitions. [2020-12-23 09:35:39,062 INFO L78 Accepts]: Start accepts. Automaton has 14094 states and 19555 transitions. Word has length 279 [2020-12-23 09:35:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:39,062 INFO L481 AbstractCegarLoop]: Abstraction has 14094 states and 19555 transitions. [2020-12-23 09:35:39,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:39,062 INFO L276 IsEmpty]: Start isEmpty. Operand 14094 states and 19555 transitions. [2020-12-23 09:35:39,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:39,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:39,069 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:39,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 09:35:39,069 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:39,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:39,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2058345365, now seen corresponding path program 1 times [2020-12-23 09:35:39,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:39,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958191176] [2020-12-23 09:35:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:35:39,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958191176] [2020-12-23 09:35:39,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:39,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:39,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11078197] [2020-12-23 09:35:39,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:39,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:39,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:39,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:39,324 INFO L87 Difference]: Start difference. First operand 14094 states and 19555 transitions. Second operand 5 states. [2020-12-23 09:35:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:43,008 INFO L93 Difference]: Finished difference Result 50387 states and 70386 transitions. [2020-12-23 09:35:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:43,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:43,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:43,045 INFO L225 Difference]: With dead ends: 50387 [2020-12-23 09:35:43,045 INFO L226 Difference]: Without dead ends: 36381 [2020-12-23 09:35:43,059 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:35:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36381 states. [2020-12-23 09:35:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36381 to 14445. [2020-12-23 09:35:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14445 states. [2020-12-23 09:35:44,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14445 states to 14445 states and 19906 transitions. [2020-12-23 09:35:44,770 INFO L78 Accepts]: Start accepts. Automaton has 14445 states and 19906 transitions. Word has length 279 [2020-12-23 09:35:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:44,771 INFO L481 AbstractCegarLoop]: Abstraction has 14445 states and 19906 transitions. [2020-12-23 09:35:44,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:44,771 INFO L276 IsEmpty]: Start isEmpty. Operand 14445 states and 19906 transitions. [2020-12-23 09:35:44,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:44,777 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:44,777 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:44,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 09:35:44,778 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:44,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:44,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1952636393, now seen corresponding path program 1 times [2020-12-23 09:35:44,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:44,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695648064] [2020-12-23 09:35:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:35:44,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695648064] [2020-12-23 09:35:44,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:44,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:44,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751147627] [2020-12-23 09:35:44,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:44,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:44,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:44,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:44,892 INFO L87 Difference]: Start difference. First operand 14445 states and 19906 transitions. Second operand 3 states. [2020-12-23 09:35:47,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:47,785 INFO L93 Difference]: Finished difference Result 42102 states and 57991 transitions. [2020-12-23 09:35:47,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:47,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2020-12-23 09:35:47,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:47,808 INFO L225 Difference]: With dead ends: 42102 [2020-12-23 09:35:47,808 INFO L226 Difference]: Without dead ends: 27750 [2020-12-23 09:35:47,818 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:35:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27750 states. [2020-12-23 09:35:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27750 to 27732. [2020-12-23 09:35:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27732 states. [2020-12-23 09:35:50,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27732 states to 27732 states and 38071 transitions. [2020-12-23 09:35:50,995 INFO L78 Accepts]: Start accepts. Automaton has 27732 states and 38071 transitions. Word has length 279 [2020-12-23 09:35:50,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:50,995 INFO L481 AbstractCegarLoop]: Abstraction has 27732 states and 38071 transitions. [2020-12-23 09:35:50,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:50,995 INFO L276 IsEmpty]: Start isEmpty. Operand 27732 states and 38071 transitions. [2020-12-23 09:35:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:51,006 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:51,006 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:51,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 09:35:51,006 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1056893144, now seen corresponding path program 1 times [2020-12-23 09:35:51,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:51,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578495284] [2020-12-23 09:35:51,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:35:51,206 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578495284] [2020-12-23 09:35:51,206 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:51,206 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:51,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386352889] [2020-12-23 09:35:51,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:51,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:51,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:51,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:51,208 INFO L87 Difference]: Start difference. First operand 27732 states and 38071 transitions. Second operand 5 states. [2020-12-23 09:35:56,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:56,603 INFO L93 Difference]: Finished difference Result 77019 states and 106336 transitions. [2020-12-23 09:35:56,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:56,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:56,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:56,650 INFO L225 Difference]: With dead ends: 77019 [2020-12-23 09:35:56,650 INFO L226 Difference]: Without dead ends: 49384 [2020-12-23 09:35:56,672 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:35:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49384 states. [2020-12-23 09:36:00,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49384 to 28080. [2020-12-23 09:36:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28080 states. [2020-12-23 09:36:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28080 states to 28080 states and 38310 transitions. [2020-12-23 09:36:00,233 INFO L78 Accepts]: Start accepts. Automaton has 28080 states and 38310 transitions. Word has length 279 [2020-12-23 09:36:00,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:00,233 INFO L481 AbstractCegarLoop]: Abstraction has 28080 states and 38310 transitions. [2020-12-23 09:36:00,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:36:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 28080 states and 38310 transitions. [2020-12-23 09:36:00,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:36:00,247 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:00,247 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:00,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 09:36:00,247 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:00,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:00,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1516316708, now seen corresponding path program 1 times [2020-12-23 09:36:00,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:00,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22025315] [2020-12-23 09:36:00,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:36:00,364 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22025315] [2020-12-23 09:36:00,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:00,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:00,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688184517] [2020-12-23 09:36:00,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:00,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:00,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:00,366 INFO L87 Difference]: Start difference. First operand 28080 states and 38310 transitions. Second operand 4 states. [2020-12-23 09:36:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:08,045 INFO L93 Difference]: Finished difference Result 95954 states and 130733 transitions. [2020-12-23 09:36:08,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:36:08,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2020-12-23 09:36:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:08,107 INFO L225 Difference]: With dead ends: 95954 [2020-12-23 09:36:08,107 INFO L226 Difference]: Without dead ends: 67973 [2020-12-23 09:36:08,129 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:36:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67973 states. [2020-12-23 09:36:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67973 to 54015. [2020-12-23 09:36:14,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54015 states. [2020-12-23 09:36:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54015 states to 54015 states and 73423 transitions. [2020-12-23 09:36:14,504 INFO L78 Accepts]: Start accepts. Automaton has 54015 states and 73423 transitions. Word has length 279 [2020-12-23 09:36:14,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:14,504 INFO L481 AbstractCegarLoop]: Abstraction has 54015 states and 73423 transitions. [2020-12-23 09:36:14,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 54015 states and 73423 transitions. [2020-12-23 09:36:14,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:36:14,525 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:14,525 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:14,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 09:36:14,525 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:14,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:14,526 INFO L82 PathProgramCache]: Analyzing trace with hash -604989858, now seen corresponding path program 1 times [2020-12-23 09:36:14,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:14,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562345995] [2020-12-23 09:36:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:14,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:36:14,625 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562345995] [2020-12-23 09:36:14,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:14,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:36:14,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308833299] [2020-12-23 09:36:14,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:36:14,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:36:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:36:14,627 INFO L87 Difference]: Start difference. First operand 54015 states and 73423 transitions. Second operand 5 states. [2020-12-23 09:36:25,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:25,276 INFO L93 Difference]: Finished difference Result 148627 states and 203306 transitions. [2020-12-23 09:36:25,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:36:25,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:36:25,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:25,369 INFO L225 Difference]: With dead ends: 148627 [2020-12-23 09:36:25,370 INFO L226 Difference]: Without dead ends: 94715 [2020-12-23 09:36:25,411 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:36:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94715 states. [2020-12-23 09:36:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94715 to 54687. [2020-12-23 09:36:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54687 states. [2020-12-23 09:36:32,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54687 states to 54687 states and 73886 transitions. [2020-12-23 09:36:32,424 INFO L78 Accepts]: Start accepts. Automaton has 54687 states and 73886 transitions. Word has length 279 [2020-12-23 09:36:32,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:32,425 INFO L481 AbstractCegarLoop]: Abstraction has 54687 states and 73886 transitions. [2020-12-23 09:36:32,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:36:32,425 INFO L276 IsEmpty]: Start isEmpty. Operand 54687 states and 73886 transitions. [2020-12-23 09:36:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:36:32,444 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:32,444 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:32,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 09:36:32,445 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash -119465886, now seen corresponding path program 1 times [2020-12-23 09:36:32,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:32,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179655980] [2020-12-23 09:36:32,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:32,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:36:32,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179655980] [2020-12-23 09:36:32,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:32,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:32,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599593840] [2020-12-23 09:36:32,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:32,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:32,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:32,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:32,568 INFO L87 Difference]: Start difference. First operand 54687 states and 73886 transitions. Second operand 4 states. [2020-12-23 09:36:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:48,180 INFO L93 Difference]: Finished difference Result 186655 states and 251833 transitions. [2020-12-23 09:36:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:36:48,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2020-12-23 09:36:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:48,333 INFO L225 Difference]: With dead ends: 186655 [2020-12-23 09:36:48,334 INFO L226 Difference]: Without dead ends: 132080 [2020-12-23 09:36:48,393 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:36:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132080 states. [2020-12-23 09:37:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132080 to 105246. [2020-12-23 09:37:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105246 states. [2020-12-23 09:37:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105246 states to 105246 states and 141691 transitions. [2020-12-23 09:37:01,676 INFO L78 Accepts]: Start accepts. Automaton has 105246 states and 141691 transitions. Word has length 279 [2020-12-23 09:37:01,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:01,677 INFO L481 AbstractCegarLoop]: Abstraction has 105246 states and 141691 transitions. [2020-12-23 09:37:01,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 105246 states and 141691 transitions. [2020-12-23 09:37:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:37:01,699 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:01,700 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 09:37:01,700 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:01,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:01,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1391785500, now seen corresponding path program 1 times [2020-12-23 09:37:01,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:01,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18647127] [2020-12-23 09:37:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:01,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:37:01,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18647127] [2020-12-23 09:37:01,813 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:01,814 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:01,814 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794034414] [2020-12-23 09:37:01,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:01,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:01,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:01,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:01,815 INFO L87 Difference]: Start difference. First operand 105246 states and 141691 transitions. Second operand 5 states. [2020-12-23 09:37:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:23,552 INFO L93 Difference]: Finished difference Result 283740 states and 384342 transitions. [2020-12-23 09:37:23,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:23,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:37:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:23,763 INFO L225 Difference]: With dead ends: 283740 [2020-12-23 09:37:23,763 INFO L226 Difference]: Without dead ends: 178610 [2020-12-23 09:37:24,080 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:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178610 states. [2020-12-23 09:37:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178610 to 106542. [2020-12-23 09:37:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106542 states. [2020-12-23 09:37:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106542 states to 106542 states and 142586 transitions. [2020-12-23 09:37:38,091 INFO L78 Accepts]: Start accepts. Automaton has 106542 states and 142586 transitions. Word has length 279 [2020-12-23 09:37:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:38,092 INFO L481 AbstractCegarLoop]: Abstraction has 106542 states and 142586 transitions. [2020-12-23 09:37:38,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 106542 states and 142586 transitions. [2020-12-23 09:37:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:37:38,127 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:38,127 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 09:37:38,128 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:38,128 INFO L82 PathProgramCache]: Analyzing trace with hash 894136808, now seen corresponding path program 1 times [2020-12-23 09:37:38,128 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:38,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001951872] [2020-12-23 09:37:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:38,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:37:38,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001951872] [2020-12-23 09:37:38,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:38,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:38,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755205426] [2020-12-23 09:37:38,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:38,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:38,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:38,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:38,462 INFO L87 Difference]: Start difference. First operand 106542 states and 142586 transitions. Second operand 5 states. [2020-12-23 09:38:08,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:08,355 INFO L93 Difference]: Finished difference Result 350378 states and 472875 transitions. [2020-12-23 09:38:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:08,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:38:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:08,877 INFO L225 Difference]: With dead ends: 350378 [2020-12-23 09:38:08,877 INFO L226 Difference]: Without dead ends: 243959 [2020-12-23 09:38:08,975 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:09,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243959 states.