/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-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:34:46,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:34:46,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:34:46,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:34:46,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:34:46,842 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:34:46,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:34:46,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:34:46,865 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:34:46,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:34:46,876 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:34:46,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:34:46,880 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:34:46,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:34:46,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:34:46,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:34:46,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:34:46,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:34:46,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:34:46,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:34:46,905 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:34:46,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:34:46,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:34:46,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:34:46,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:34:46,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:34:46,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:34:46,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:34:46,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:34:46,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:34:46,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:34:46,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:34:46,932 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:34:46,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:34:46,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:34:46,934 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:34:46,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:34:46,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:34:46,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:34:46,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:34:46,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:34:46,946 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:46,990 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:34:46,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:34:46,995 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:34:46,995 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:34:46,995 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:34:46,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:34:46,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:34:46,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:34:46,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:34:46,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:34:46,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:34:46,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:34:46,998 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:34:46,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:34:46,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:34:46,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:34:47,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:34:47,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:34:47,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:34:47,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:34:47,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:34:47,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:34:47,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:34:47,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:34:47,002 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:34:47,002 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:47,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:34:47,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:34:47,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:34:47,418 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:34:47,421 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:34:47,422 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-1.c [2020-12-23 09:34:47,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0d4ee18b3/421f4fad95c94f0c82dbd8b03d5aa1e2/FLAG8b68f81e6 [2020-12-23 09:34:48,199 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:34:48,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-1.c [2020-12-23 09:34:48,230 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0d4ee18b3/421f4fad95c94f0c82dbd8b03d5aa1e2/FLAG8b68f81e6 [2020-12-23 09:34:48,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0d4ee18b3/421f4fad95c94f0c82dbd8b03d5aa1e2 [2020-12-23 09:34:48,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:34:48,488 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:34:48,490 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:34:48,490 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:34:48,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:34:48,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:34:48" (1/1) ... [2020-12-23 09:34:48,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b06b257 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:48, skipping insertion in model container [2020-12-23 09:34:48,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:34:48" (1/1) ... [2020-12-23 09:34:48,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:34:48,561 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:34:48,708 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-1.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:48,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:34:48,958 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:34:48,978 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-1.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:49,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:34:49,160 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:34:49,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:49 WrapperNode [2020-12-23 09:34:49,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:34:49,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:34:49,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:34:49,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:34:49,171 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:49" (1/1) ... [2020-12-23 09:34:49,232 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:49" (1/1) ... [2020-12-23 09:34:49,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:34:49,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:34:49,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:34:49,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:34:49,429 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:49" (1/1) ... [2020-12-23 09:34:49,429 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:49" (1/1) ... [2020-12-23 09:34:49,446 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:49" (1/1) ... [2020-12-23 09:34:49,446 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:49" (1/1) ... [2020-12-23 09:34:49,522 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:49" (1/1) ... [2020-12-23 09:34:49,580 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:49" (1/1) ... [2020-12-23 09:34:49,595 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:49" (1/1) ... [2020-12-23 09:34:49,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:34:49,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:34:49,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:34:49,620 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:34:49,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:49" (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:49,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:34:49,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:34:49,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:34:49,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:34:53,136 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:34:53,136 INFO L299 CfgBuilder]: Removed 622 assume(true) statements. [2020-12-23 09:34:53,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:34:53 BoogieIcfgContainer [2020-12-23 09:34:53,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:34:53,142 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:34:53,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:34:53,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:34:53,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:34:48" (1/3) ... [2020-12-23 09:34:53,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78207292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:34:53, skipping insertion in model container [2020-12-23 09:34:53,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:34:49" (2/3) ... [2020-12-23 09:34:53,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78207292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:34:53, skipping insertion in model container [2020-12-23 09:34:53,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:34:53" (3/3) ... [2020-12-23 09:34:53,149 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.13.cil-1.c [2020-12-23 09:34:53,156 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:34:53,162 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 09:34:53,180 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-23 09:34:53,222 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:34:53,222 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:34:53,222 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:34:53,222 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:34:53,222 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:34:53,223 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:34:53,223 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:34:53,223 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:34:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states. [2020-12-23 09:34:53,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:53,286 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:53,287 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:53,288 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:53,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:53,294 INFO L82 PathProgramCache]: Analyzing trace with hash 585149193, now seen corresponding path program 1 times [2020-12-23 09:34:53,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:53,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104626487] [2020-12-23 09:34:53,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:34:53,657 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:34:53,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104626487] [2020-12-23 09:34:53,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:34:53,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:34:53,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593884555] [2020-12-23 09:34:53,665 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:34:53,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:34:53,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:34:53,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:34:53,682 INFO L87 Difference]: Start difference. First operand 1996 states. Second operand 3 states. [2020-12-23 09:34:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:34:53,878 INFO L93 Difference]: Finished difference Result 3987 states and 5999 transitions. [2020-12-23 09:34:53,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:34:53,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:34:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:34:53,918 INFO L225 Difference]: With dead ends: 3987 [2020-12-23 09:34:53,918 INFO L226 Difference]: Without dead ends: 1992 [2020-12-23 09:34:53,931 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:34:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2020-12-23 09:34:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1992. [2020-12-23 09:34:54,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2020-12-23 09:34:54,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2964 transitions. [2020-12-23 09:34:54,075 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2964 transitions. Word has length 171 [2020-12-23 09:34:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:34:54,075 INFO L481 AbstractCegarLoop]: Abstraction has 1992 states and 2964 transitions. [2020-12-23 09:34:54,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:34:54,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2964 transitions. [2020-12-23 09:34:54,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:54,080 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:54,080 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:34:54,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:34:54,081 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1992875143, now seen corresponding path program 1 times [2020-12-23 09:34:54,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:54,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098212194] [2020-12-23 09:34:54,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:34:54,219 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:34:54,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098212194] [2020-12-23 09:34:54,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:34:54,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:34:54,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592788810] [2020-12-23 09:34:54,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:34:54,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:34:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:34:54,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:34:54,225 INFO L87 Difference]: Start difference. First operand 1992 states and 2964 transitions. Second operand 3 states. [2020-12-23 09:34:54,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:34:54,331 INFO L93 Difference]: Finished difference Result 3971 states and 5906 transitions. [2020-12-23 09:34:54,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:34:54,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:34:54,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:34:54,345 INFO L225 Difference]: With dead ends: 3971 [2020-12-23 09:34:54,345 INFO L226 Difference]: Without dead ends: 1992 [2020-12-23 09:34:54,350 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:34:54,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2020-12-23 09:34:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1992. [2020-12-23 09:34:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2020-12-23 09:34:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2963 transitions. [2020-12-23 09:34:54,424 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2963 transitions. Word has length 171 [2020-12-23 09:34:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:34:54,426 INFO L481 AbstractCegarLoop]: Abstraction has 1992 states and 2963 transitions. [2020-12-23 09:34:54,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:34:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2963 transitions. [2020-12-23 09:34:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:54,436 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:54,436 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:34:54,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:34:54,437 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:54,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1325493253, now seen corresponding path program 1 times [2020-12-23 09:34:54,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:54,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105049764] [2020-12-23 09:34:54,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:34:54,606 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:34:54,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105049764] [2020-12-23 09:34:54,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:34:54,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:34:54,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942948010] [2020-12-23 09:34:54,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:34:54,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:34:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:34:54,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:34:54,610 INFO L87 Difference]: Start difference. First operand 1992 states and 2963 transitions. Second operand 3 states. [2020-12-23 09:34:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:34:54,897 INFO L93 Difference]: Finished difference Result 5688 states and 8435 transitions. [2020-12-23 09:34:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:34:54,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:34:54,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:34:54,924 INFO L225 Difference]: With dead ends: 5688 [2020-12-23 09:34:54,925 INFO L226 Difference]: Without dead ends: 3714 [2020-12-23 09:34:54,934 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:34:54,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2020-12-23 09:34:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 3710. [2020-12-23 09:34:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:34:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5497 transitions. [2020-12-23 09:34:55,148 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5497 transitions. Word has length 171 [2020-12-23 09:34:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:34:55,157 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5497 transitions. [2020-12-23 09:34:55,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:34:55,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5497 transitions. [2020-12-23 09:34:55,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:55,164 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:55,164 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:34:55,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:34:55,165 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:55,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:55,166 INFO L82 PathProgramCache]: Analyzing trace with hash 962370689, now seen corresponding path program 1 times [2020-12-23 09:34:55,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:55,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351908046] [2020-12-23 09:34:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:34:55,385 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:34:55,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351908046] [2020-12-23 09:34:55,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:34:55,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:34:55,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577952783] [2020-12-23 09:34:55,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:34:55,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:34:55,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:34:55,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:34:55,391 INFO L87 Difference]: Start difference. First operand 3710 states and 5497 transitions. Second operand 4 states. [2020-12-23 09:34:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:34:55,788 INFO L93 Difference]: Finished difference Result 9122 states and 13498 transitions. [2020-12-23 09:34:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:34:55,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:34:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:34:55,816 INFO L225 Difference]: With dead ends: 9122 [2020-12-23 09:34:55,816 INFO L226 Difference]: Without dead ends: 5431 [2020-12-23 09:34:55,822 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:34:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5431 states. [2020-12-23 09:34:56,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5431 to 3710. [2020-12-23 09:34:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:34:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5494 transitions. [2020-12-23 09:34:56,022 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5494 transitions. Word has length 171 [2020-12-23 09:34:56,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:34:56,022 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5494 transitions. [2020-12-23 09:34:56,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:34:56,023 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5494 transitions. [2020-12-23 09:34:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:56,025 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:56,025 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:34:56,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:34:56,025 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:56,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:56,027 INFO L82 PathProgramCache]: Analyzing trace with hash -442820989, now seen corresponding path program 1 times [2020-12-23 09:34:56,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:56,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006363401] [2020-12-23 09:34:56,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:34:56,150 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:34:56,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006363401] [2020-12-23 09:34:56,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:34:56,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:34:56,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51789467] [2020-12-23 09:34:56,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:34:56,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:34:56,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:34:56,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:34:56,154 INFO L87 Difference]: Start difference. First operand 3710 states and 5494 transitions. Second operand 4 states. [2020-12-23 09:34:56,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:34:56,560 INFO L93 Difference]: Finished difference Result 9120 states and 13488 transitions. [2020-12-23 09:34:56,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:34:56,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:34:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:34:56,590 INFO L225 Difference]: With dead ends: 9120 [2020-12-23 09:34:56,590 INFO L226 Difference]: Without dead ends: 5430 [2020-12-23 09:34:56,597 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:34:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5430 states. [2020-12-23 09:34:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5430 to 3710. [2020-12-23 09:34:56,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:34:56,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5491 transitions. [2020-12-23 09:34:56,825 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5491 transitions. Word has length 171 [2020-12-23 09:34:56,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:34:56,825 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5491 transitions. [2020-12-23 09:34:56,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:34:56,826 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5491 transitions. [2020-12-23 09:34:56,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:56,828 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:56,828 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:34:56,829 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:34:56,829 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:56,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1451512897, now seen corresponding path program 1 times [2020-12-23 09:34:56,830 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:56,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910214316] [2020-12-23 09:34:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:34:56,940 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:34:56,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910214316] [2020-12-23 09:34:56,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:34:56,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:34:56,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241321232] [2020-12-23 09:34:56,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:34:56,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:34:56,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:34:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:34:56,943 INFO L87 Difference]: Start difference. First operand 3710 states and 5491 transitions. Second operand 3 states. [2020-12-23 09:34:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:34:57,179 INFO L93 Difference]: Finished difference Result 7398 states and 10946 transitions. [2020-12-23 09:34:57,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:34:57,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:34:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:34:57,199 INFO L225 Difference]: With dead ends: 7398 [2020-12-23 09:34:57,199 INFO L226 Difference]: Without dead ends: 3710 [2020-12-23 09:34:57,207 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:34:57,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2020-12-23 09:34:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2020-12-23 09:34:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:34:57,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5483 transitions. [2020-12-23 09:34:57,422 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5483 transitions. Word has length 171 [2020-12-23 09:34:57,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:34:57,422 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5483 transitions. [2020-12-23 09:34:57,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:34:57,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5483 transitions. [2020-12-23 09:34:57,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:57,425 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:57,425 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:34:57,425 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:34:57,425 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:57,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:57,431 INFO L82 PathProgramCache]: Analyzing trace with hash -501013827, now seen corresponding path program 1 times [2020-12-23 09:34:57,431 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:57,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199156422] [2020-12-23 09:34:57,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:34:57,533 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:34:57,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199156422] [2020-12-23 09:34:57,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:34:57,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:34:57,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764143712] [2020-12-23 09:34:57,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:34:57,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:34:57,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:34:57,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:34:57,538 INFO L87 Difference]: Start difference. First operand 3710 states and 5483 transitions. Second operand 3 states. [2020-12-23 09:34:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:34:57,758 INFO L93 Difference]: Finished difference Result 7397 states and 10929 transitions. [2020-12-23 09:34:57,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:34:57,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:34:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:34:57,789 INFO L225 Difference]: With dead ends: 7397 [2020-12-23 09:34:57,789 INFO L226 Difference]: Without dead ends: 3710 [2020-12-23 09:34:57,803 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:34:57,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2020-12-23 09:34:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2020-12-23 09:34:58,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:34:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5475 transitions. [2020-12-23 09:34:58,012 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5475 transitions. Word has length 171 [2020-12-23 09:34:58,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:34:58,013 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5475 transitions. [2020-12-23 09:34:58,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:34:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5475 transitions. [2020-12-23 09:34:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:58,015 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:58,015 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:34:58,015 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:34:58,016 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash 544380097, now seen corresponding path program 1 times [2020-12-23 09:34:58,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:58,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707557767] [2020-12-23 09:34:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:34:58,101 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:34:58,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707557767] [2020-12-23 09:34:58,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:34:58,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:34:58,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324349396] [2020-12-23 09:34:58,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:34:58,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:34:58,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:34:58,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:34:58,104 INFO L87 Difference]: Start difference. First operand 3710 states and 5475 transitions. Second operand 4 states. [2020-12-23 09:34:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:34:58,423 INFO L93 Difference]: Finished difference Result 9112 states and 13432 transitions. [2020-12-23 09:34:58,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:34:58,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:34:58,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:34:58,438 INFO L225 Difference]: With dead ends: 9112 [2020-12-23 09:34:58,439 INFO L226 Difference]: Without dead ends: 5426 [2020-12-23 09:34:58,447 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:34:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2020-12-23 09:34:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 3710. [2020-12-23 09:34:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:34:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5472 transitions. [2020-12-23 09:34:58,643 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5472 transitions. Word has length 171 [2020-12-23 09:34:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:34:58,643 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5472 transitions. [2020-12-23 09:34:58,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:34:58,643 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5472 transitions. [2020-12-23 09:34:58,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:58,646 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:58,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:34:58,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:34:58,646 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:58,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:58,647 INFO L82 PathProgramCache]: Analyzing trace with hash 279732607, now seen corresponding path program 1 times [2020-12-23 09:34:58,648 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:58,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905447394] [2020-12-23 09:34:58,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:34:58,719 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:34:58,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905447394] [2020-12-23 09:34:58,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:34:58,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:34:58,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394163303] [2020-12-23 09:34:58,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:34:58,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:34:58,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:34:58,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:34:58,728 INFO L87 Difference]: Start difference. First operand 3710 states and 5472 transitions. Second operand 4 states. [2020-12-23 09:34:59,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:34:59,084 INFO L93 Difference]: Finished difference Result 9110 states and 13422 transitions. [2020-12-23 09:34:59,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:34:59,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:34:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:34:59,098 INFO L225 Difference]: With dead ends: 9110 [2020-12-23 09:34:59,098 INFO L226 Difference]: Without dead ends: 5425 [2020-12-23 09:34:59,106 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:34:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5425 states. [2020-12-23 09:34:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5425 to 3710. [2020-12-23 09:34:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:34:59,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5469 transitions. [2020-12-23 09:34:59,288 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5469 transitions. Word has length 171 [2020-12-23 09:34:59,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:34:59,289 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5469 transitions. [2020-12-23 09:34:59,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:34:59,289 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5469 transitions. [2020-12-23 09:34:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:59,291 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:59,291 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:34:59,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:34:59,292 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:59,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2084109055, now seen corresponding path program 1 times [2020-12-23 09:34:59,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:59,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173740977] [2020-12-23 09:34:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:34:59,357 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:34:59,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173740977] [2020-12-23 09:34:59,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:34:59,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:34:59,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987607107] [2020-12-23 09:34:59,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:34:59,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:34:59,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:34:59,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:34:59,360 INFO L87 Difference]: Start difference. First operand 3710 states and 5469 transitions. Second operand 4 states. [2020-12-23 09:34:59,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:34:59,702 INFO L93 Difference]: Finished difference Result 9108 states and 13412 transitions. [2020-12-23 09:34:59,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:34:59,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:34:59,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:34:59,716 INFO L225 Difference]: With dead ends: 9108 [2020-12-23 09:34:59,716 INFO L226 Difference]: Without dead ends: 5424 [2020-12-23 09:34:59,724 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:34:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5424 states. [2020-12-23 09:34:59,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5424 to 3710. [2020-12-23 09:34:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:34:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5466 transitions. [2020-12-23 09:34:59,934 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5466 transitions. Word has length 171 [2020-12-23 09:34:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:34:59,934 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5466 transitions. [2020-12-23 09:34:59,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:34:59,935 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5466 transitions. [2020-12-23 09:34:59,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:34:59,937 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:34:59,937 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:34:59,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:34:59,937 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:34:59,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:34:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash 887679295, now seen corresponding path program 1 times [2020-12-23 09:34:59,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:34:59,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608462076] [2020-12-23 09:34:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:34:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:00,046 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:00,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608462076] [2020-12-23 09:35:00,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:00,048 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:00,048 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503049794] [2020-12-23 09:35:00,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:00,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:00,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:00,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:00,049 INFO L87 Difference]: Start difference. First operand 3710 states and 5466 transitions. Second operand 4 states. [2020-12-23 09:35:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:00,430 INFO L93 Difference]: Finished difference Result 9106 states and 13402 transitions. [2020-12-23 09:35:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:00,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:00,443 INFO L225 Difference]: With dead ends: 9106 [2020-12-23 09:35:00,443 INFO L226 Difference]: Without dead ends: 5423 [2020-12-23 09:35:00,450 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:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2020-12-23 09:35:00,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 3710. [2020-12-23 09:35:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5463 transitions. [2020-12-23 09:35:00,659 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5463 transitions. Word has length 171 [2020-12-23 09:35:00,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:00,660 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5463 transitions. [2020-12-23 09:35:00,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:00,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5463 transitions. [2020-12-23 09:35:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:00,662 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:00,662 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:00,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:35:00,663 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:00,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1510308543, now seen corresponding path program 1 times [2020-12-23 09:35:00,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:00,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646266969] [2020-12-23 09:35:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:00,724 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:00,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646266969] [2020-12-23 09:35:00,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:00,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:00,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948429352] [2020-12-23 09:35:00,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:00,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:00,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:00,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:00,726 INFO L87 Difference]: Start difference. First operand 3710 states and 5463 transitions. Second operand 3 states. [2020-12-23 09:35:00,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:00,967 INFO L93 Difference]: Finished difference Result 7392 states and 10884 transitions. [2020-12-23 09:35:00,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:00,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:00,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:00,976 INFO L225 Difference]: With dead ends: 7392 [2020-12-23 09:35:00,976 INFO L226 Difference]: Without dead ends: 3710 [2020-12-23 09:35:00,983 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:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2020-12-23 09:35:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2020-12-23 09:35:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5455 transitions. [2020-12-23 09:35:01,247 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5455 transitions. Word has length 171 [2020-12-23 09:35:01,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:01,247 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5455 transitions. [2020-12-23 09:35:01,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5455 transitions. [2020-12-23 09:35:01,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:01,256 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:01,256 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:01,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:35:01,257 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash -897261379, now seen corresponding path program 1 times [2020-12-23 09:35:01,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:01,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095336331] [2020-12-23 09:35:01,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:01,373 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:01,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095336331] [2020-12-23 09:35:01,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:01,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:01,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594247226] [2020-12-23 09:35:01,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:01,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:01,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:01,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:01,376 INFO L87 Difference]: Start difference. First operand 3710 states and 5455 transitions. Second operand 4 states. [2020-12-23 09:35:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:01,874 INFO L93 Difference]: Finished difference Result 9100 states and 13367 transitions. [2020-12-23 09:35:01,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:01,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:01,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:01,889 INFO L225 Difference]: With dead ends: 9100 [2020-12-23 09:35:01,889 INFO L226 Difference]: Without dead ends: 5420 [2020-12-23 09:35:01,903 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:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2020-12-23 09:35:02,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 3710. [2020-12-23 09:35:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:02,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5452 transitions. [2020-12-23 09:35:02,137 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5452 transitions. Word has length 171 [2020-12-23 09:35:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:02,138 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5452 transitions. [2020-12-23 09:35:02,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5452 transitions. [2020-12-23 09:35:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:02,140 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:02,140 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:02,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:35:02,141 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:02,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:02,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1437690885, now seen corresponding path program 1 times [2020-12-23 09:35:02,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:02,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930925794] [2020-12-23 09:35:02,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:02,222 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:02,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930925794] [2020-12-23 09:35:02,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:02,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:02,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323846162] [2020-12-23 09:35:02,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:02,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:02,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:02,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:02,225 INFO L87 Difference]: Start difference. First operand 3710 states and 5452 transitions. Second operand 3 states. [2020-12-23 09:35:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:02,433 INFO L93 Difference]: Finished difference Result 7389 states and 10858 transitions. [2020-12-23 09:35:02,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:02,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:02,442 INFO L225 Difference]: With dead ends: 7389 [2020-12-23 09:35:02,442 INFO L226 Difference]: Without dead ends: 3710 [2020-12-23 09:35:02,450 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:02,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2020-12-23 09:35:02,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2020-12-23 09:35:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5444 transitions. [2020-12-23 09:35:02,697 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5444 transitions. Word has length 171 [2020-12-23 09:35:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:02,698 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5444 transitions. [2020-12-23 09:35:02,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5444 transitions. [2020-12-23 09:35:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:02,700 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:02,700 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:02,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:35:02,702 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:02,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:02,702 INFO L82 PathProgramCache]: Analyzing trace with hash -207468033, now seen corresponding path program 1 times [2020-12-23 09:35:02,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:02,703 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769407268] [2020-12-23 09:35:02,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:02,782 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:02,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769407268] [2020-12-23 09:35:02,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:02,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:02,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855388166] [2020-12-23 09:35:02,784 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:02,784 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:02,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:02,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:02,787 INFO L87 Difference]: Start difference. First operand 3710 states and 5444 transitions. Second operand 4 states. [2020-12-23 09:35:03,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:03,251 INFO L93 Difference]: Finished difference Result 8998 states and 13196 transitions. [2020-12-23 09:35:03,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:03,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:03,264 INFO L225 Difference]: With dead ends: 8998 [2020-12-23 09:35:03,264 INFO L226 Difference]: Without dead ends: 5320 [2020-12-23 09:35:03,271 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:03,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2020-12-23 09:35:03,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 3710. [2020-12-23 09:35:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5441 transitions. [2020-12-23 09:35:03,490 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5441 transitions. Word has length 171 [2020-12-23 09:35:03,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:03,491 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5441 transitions. [2020-12-23 09:35:03,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:03,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5441 transitions. [2020-12-23 09:35:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:03,492 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:03,492 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,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:35:03,493 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:03,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:03,493 INFO L82 PathProgramCache]: Analyzing trace with hash 203142333, now seen corresponding path program 1 times [2020-12-23 09:35:03,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:03,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258763248] [2020-12-23 09:35:03,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:03,554 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,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258763248] [2020-12-23 09:35:03,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:03,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:03,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427711382] [2020-12-23 09:35:03,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:03,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:03,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:03,556 INFO L87 Difference]: Start difference. First operand 3710 states and 5441 transitions. Second operand 4 states. [2020-12-23 09:35:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:04,059 INFO L93 Difference]: Finished difference Result 8996 states and 13186 transitions. [2020-12-23 09:35:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:04,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:04,071 INFO L225 Difference]: With dead ends: 8996 [2020-12-23 09:35:04,072 INFO L226 Difference]: Without dead ends: 5319 [2020-12-23 09:35:04,078 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:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2020-12-23 09:35:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 3710. [2020-12-23 09:35:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5438 transitions. [2020-12-23 09:35:04,310 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5438 transitions. Word has length 171 [2020-12-23 09:35:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:04,310 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5438 transitions. [2020-12-23 09:35:04,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5438 transitions. [2020-12-23 09:35:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:04,312 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:04,312 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,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:35:04,312 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:04,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:04,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1584727489, now seen corresponding path program 1 times [2020-12-23 09:35:04,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:04,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389338291] [2020-12-23 09:35:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:04,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:04,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389338291] [2020-12-23 09:35:04,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:04,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:04,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661477245] [2020-12-23 09:35:04,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:04,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:04,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:04,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:04,378 INFO L87 Difference]: Start difference. First operand 3710 states and 5438 transitions. Second operand 3 states. [2020-12-23 09:35:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:04,644 INFO L93 Difference]: Finished difference Result 7386 states and 10827 transitions. [2020-12-23 09:35:04,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:04,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:04,653 INFO L225 Difference]: With dead ends: 7386 [2020-12-23 09:35:04,653 INFO L226 Difference]: Without dead ends: 3710 [2020-12-23 09:35:04,660 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:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2020-12-23 09:35:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2020-12-23 09:35:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5400 transitions. [2020-12-23 09:35:04,881 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5400 transitions. Word has length 171 [2020-12-23 09:35:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:04,882 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5400 transitions. [2020-12-23 09:35:04,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5400 transitions. [2020-12-23 09:35:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:04,883 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:04,883 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,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:35:04,884 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:04,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1653021692, now seen corresponding path program 1 times [2020-12-23 09:35:04,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:04,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655818135] [2020-12-23 09:35:04,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:04,948 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,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655818135] [2020-12-23 09:35:04,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:04,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:04,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30526473] [2020-12-23 09:35:04,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:04,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:04,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:04,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:04,951 INFO L87 Difference]: Start difference. First operand 3710 states and 5400 transitions. Second operand 4 states. [2020-12-23 09:35:05,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:05,439 INFO L93 Difference]: Finished difference Result 8992 states and 13082 transitions. [2020-12-23 09:35:05,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:05,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:05,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:05,450 INFO L225 Difference]: With dead ends: 8992 [2020-12-23 09:35:05,451 INFO L226 Difference]: Without dead ends: 5317 [2020-12-23 09:35:05,457 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:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2020-12-23 09:35:05,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 3710. [2020-12-23 09:35:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5397 transitions. [2020-12-23 09:35:05,702 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5397 transitions. Word has length 171 [2020-12-23 09:35:05,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:05,702 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5397 transitions. [2020-12-23 09:35:05,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5397 transitions. [2020-12-23 09:35:05,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:05,704 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:05,704 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,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:35:05,705 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:05,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:05,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1722669566, now seen corresponding path program 1 times [2020-12-23 09:35:05,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:05,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781994788] [2020-12-23 09:35:05,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:05,773 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,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781994788] [2020-12-23 09:35:05,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:05,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:05,774 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500194019] [2020-12-23 09:35:05,776 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:05,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:05,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:05,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:05,777 INFO L87 Difference]: Start difference. First operand 3710 states and 5397 transitions. Second operand 4 states. [2020-12-23 09:35:06,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:06,261 INFO L93 Difference]: Finished difference Result 8990 states and 13072 transitions. [2020-12-23 09:35:06,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:06,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:06,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:06,273 INFO L225 Difference]: With dead ends: 8990 [2020-12-23 09:35:06,273 INFO L226 Difference]: Without dead ends: 5316 [2020-12-23 09:35:06,278 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,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2020-12-23 09:35:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 3710. [2020-12-23 09:35:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5394 transitions. [2020-12-23 09:35:06,648 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5394 transitions. Word has length 171 [2020-12-23 09:35:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:06,649 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5394 transitions. [2020-12-23 09:35:06,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5394 transitions. [2020-12-23 09:35:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:06,650 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:06,651 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,651 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:35:06,651 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:06,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:06,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2140558268, now seen corresponding path program 1 times [2020-12-23 09:35:06,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:06,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283978129] [2020-12-23 09:35:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:06,787 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,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283978129] [2020-12-23 09:35:06,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:06,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:06,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037832417] [2020-12-23 09:35:06,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:06,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:06,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:06,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:06,789 INFO L87 Difference]: Start difference. First operand 3710 states and 5394 transitions. Second operand 4 states. [2020-12-23 09:35:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:07,290 INFO L93 Difference]: Finished difference Result 8986 states and 13058 transitions. [2020-12-23 09:35:07,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:07,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:07,301 INFO L225 Difference]: With dead ends: 8986 [2020-12-23 09:35:07,301 INFO L226 Difference]: Without dead ends: 5314 [2020-12-23 09:35:07,308 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:07,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2020-12-23 09:35:07,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 3710. [2020-12-23 09:35:07,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5391 transitions. [2020-12-23 09:35:07,593 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5391 transitions. Word has length 171 [2020-12-23 09:35:07,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:07,593 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5391 transitions. [2020-12-23 09:35:07,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5391 transitions. [2020-12-23 09:35:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:07,594 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:07,595 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,595 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:35:07,595 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:07,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:07,595 INFO L82 PathProgramCache]: Analyzing trace with hash 523117818, now seen corresponding path program 1 times [2020-12-23 09:35:07,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:07,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332958331] [2020-12-23 09:35:07,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:07,660 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,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332958331] [2020-12-23 09:35:07,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:07,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:07,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968301686] [2020-12-23 09:35:07,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:07,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:07,664 INFO L87 Difference]: Start difference. First operand 3710 states and 5391 transitions. Second operand 4 states. [2020-12-23 09:35:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:08,402 INFO L93 Difference]: Finished difference Result 8984 states and 13048 transitions. [2020-12-23 09:35:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:08,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:08,410 INFO L225 Difference]: With dead ends: 8984 [2020-12-23 09:35:08,411 INFO L226 Difference]: Without dead ends: 5313 [2020-12-23 09:35:08,417 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,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2020-12-23 09:35:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 3710. [2020-12-23 09:35:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5388 transitions. [2020-12-23 09:35:08,716 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5388 transitions. Word has length 171 [2020-12-23 09:35:08,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:08,716 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5388 transitions. [2020-12-23 09:35:08,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:08,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5388 transitions. [2020-12-23 09:35:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:08,718 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:08,718 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,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:35:08,718 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:08,719 INFO L82 PathProgramCache]: Analyzing trace with hash 886584316, now seen corresponding path program 1 times [2020-12-23 09:35:08,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:08,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615655888] [2020-12-23 09:35:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:08,787 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,787 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615655888] [2020-12-23 09:35:08,787 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:08,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:08,788 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384641121] [2020-12-23 09:35:08,788 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:08,788 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:08,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:08,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:08,790 INFO L87 Difference]: Start difference. First operand 3710 states and 5388 transitions. Second operand 4 states. [2020-12-23 09:35:09,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:09,281 INFO L93 Difference]: Finished difference Result 8982 states and 13038 transitions. [2020-12-23 09:35:09,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:09,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:09,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:09,289 INFO L225 Difference]: With dead ends: 8982 [2020-12-23 09:35:09,289 INFO L226 Difference]: Without dead ends: 5312 [2020-12-23 09:35:09,294 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,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2020-12-23 09:35:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 3710. [2020-12-23 09:35:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5385 transitions. [2020-12-23 09:35:09,661 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5385 transitions. Word has length 171 [2020-12-23 09:35:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:09,661 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5385 transitions. [2020-12-23 09:35:09,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5385 transitions. [2020-12-23 09:35:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:09,662 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:09,663 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,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:35:09,663 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:09,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:09,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1175403706, now seen corresponding path program 1 times [2020-12-23 09:35:09,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:09,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111652859] [2020-12-23 09:35:09,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:09,749 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,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111652859] [2020-12-23 09:35:09,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:09,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:09,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820774407] [2020-12-23 09:35:09,751 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:09,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:09,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:09,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:09,755 INFO L87 Difference]: Start difference. First operand 3710 states and 5385 transitions. Second operand 4 states. [2020-12-23 09:35:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:10,298 INFO L93 Difference]: Finished difference Result 8980 states and 13028 transitions. [2020-12-23 09:35:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:10,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:10,304 INFO L225 Difference]: With dead ends: 8980 [2020-12-23 09:35:10,304 INFO L226 Difference]: Without dead ends: 5311 [2020-12-23 09:35:10,308 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,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2020-12-23 09:35:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 3710. [2020-12-23 09:35:10,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:10,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5382 transitions. [2020-12-23 09:35:10,583 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5382 transitions. Word has length 171 [2020-12-23 09:35:10,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:10,583 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5382 transitions. [2020-12-23 09:35:10,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:10,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5382 transitions. [2020-12-23 09:35:10,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:10,584 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:10,584 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,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:35:10,584 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:10,585 INFO L82 PathProgramCache]: Analyzing trace with hash 630531132, now seen corresponding path program 1 times [2020-12-23 09:35:10,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:10,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119423692] [2020-12-23 09:35:10,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:10,647 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,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119423692] [2020-12-23 09:35:10,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:10,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:10,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276141843] [2020-12-23 09:35:10,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:10,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:10,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:10,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:10,649 INFO L87 Difference]: Start difference. First operand 3710 states and 5382 transitions. Second operand 4 states. [2020-12-23 09:35:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:11,142 INFO L93 Difference]: Finished difference Result 8978 states and 13018 transitions. [2020-12-23 09:35:11,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:11,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:11,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:11,147 INFO L225 Difference]: With dead ends: 8978 [2020-12-23 09:35:11,147 INFO L226 Difference]: Without dead ends: 5310 [2020-12-23 09:35:11,150 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,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2020-12-23 09:35:11,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 3710. [2020-12-23 09:35:11,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5379 transitions. [2020-12-23 09:35:11,369 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5379 transitions. Word has length 171 [2020-12-23 09:35:11,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:11,369 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5379 transitions. [2020-12-23 09:35:11,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5379 transitions. [2020-12-23 09:35:11,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:11,370 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:11,371 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,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:35:11,371 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:11,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1305691258, now seen corresponding path program 1 times [2020-12-23 09:35:11,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:11,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567666498] [2020-12-23 09:35:11,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:11,433 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,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567666498] [2020-12-23 09:35:11,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:11,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:11,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792182762] [2020-12-23 09:35:11,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:11,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:11,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:11,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:11,435 INFO L87 Difference]: Start difference. First operand 3710 states and 5379 transitions. Second operand 4 states. [2020-12-23 09:35:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:11,920 INFO L93 Difference]: Finished difference Result 8976 states and 13008 transitions. [2020-12-23 09:35:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:11,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2020-12-23 09:35:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:11,925 INFO L225 Difference]: With dead ends: 8976 [2020-12-23 09:35:11,925 INFO L226 Difference]: Without dead ends: 5309 [2020-12-23 09:35:11,928 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2020-12-23 09:35:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 3710. [2020-12-23 09:35:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5376 transitions. [2020-12-23 09:35:12,172 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5376 transitions. Word has length 171 [2020-12-23 09:35:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:12,172 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5376 transitions. [2020-12-23 09:35:12,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:12,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5376 transitions. [2020-12-23 09:35:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:12,173 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:12,173 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,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:35:12,174 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:12,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:12,174 INFO L82 PathProgramCache]: Analyzing trace with hash 357639292, now seen corresponding path program 1 times [2020-12-23 09:35:12,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:12,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262016818] [2020-12-23 09:35:12,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:12,231 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,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262016818] [2020-12-23 09:35:12,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:12,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:12,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335349248] [2020-12-23 09:35:12,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:12,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:12,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:12,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:12,234 INFO L87 Difference]: Start difference. First operand 3710 states and 5376 transitions. Second operand 3 states. [2020-12-23 09:35:12,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:12,507 INFO L93 Difference]: Finished difference Result 7376 states and 10692 transitions. [2020-12-23 09:35:12,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:12,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:12,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:12,511 INFO L225 Difference]: With dead ends: 7376 [2020-12-23 09:35:12,512 INFO L226 Difference]: Without dead ends: 3710 [2020-12-23 09:35:12,516 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,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2020-12-23 09:35:12,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2020-12-23 09:35:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2020-12-23 09:35:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5338 transitions. [2020-12-23 09:35:12,738 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5338 transitions. Word has length 171 [2020-12-23 09:35:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:12,739 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5338 transitions. [2020-12-23 09:35:12,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5338 transitions. [2020-12-23 09:35:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-12-23 09:35:12,740 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:12,740 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,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:35:12,740 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:12,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:12,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1248200712, now seen corresponding path program 1 times [2020-12-23 09:35:12,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:12,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344474916] [2020-12-23 09:35:12,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:12,798 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,798 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344474916] [2020-12-23 09:35:12,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:12,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:12,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772757253] [2020-12-23 09:35:12,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:12,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:12,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:12,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:12,800 INFO L87 Difference]: Start difference. First operand 3710 states and 5338 transitions. Second operand 3 states. [2020-12-23 09:35:13,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:13,340 INFO L93 Difference]: Finished difference Result 10862 states and 15608 transitions. [2020-12-23 09:35:13,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:13,341 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2020-12-23 09:35:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:13,347 INFO L225 Difference]: With dead ends: 10862 [2020-12-23 09:35:13,347 INFO L226 Difference]: Without dead ends: 7199 [2020-12-23 09:35:13,352 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:13,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7199 states. [2020-12-23 09:35:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7199 to 7007. [2020-12-23 09:35:13,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7007 states. [2020-12-23 09:35:13,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 10032 transitions. [2020-12-23 09:35:13,819 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 10032 transitions. Word has length 171 [2020-12-23 09:35:13,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:13,819 INFO L481 AbstractCegarLoop]: Abstraction has 7007 states and 10032 transitions. [2020-12-23 09:35:13,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 10032 transitions. [2020-12-23 09:35:13,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:13,826 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:13,826 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:13,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:35:13,827 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:13,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:13,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1901972393, now seen corresponding path program 1 times [2020-12-23 09:35:13,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:13,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549150998] [2020-12-23 09:35:13,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:13,940 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:13,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549150998] [2020-12-23 09:35:13,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:13,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:13,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674959784] [2020-12-23 09:35:13,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:13,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:13,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:13,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:13,942 INFO L87 Difference]: Start difference. First operand 7007 states and 10032 transitions. Second operand 5 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 20770 states and 29750 transitions. [2020-12-23 09:35:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:15,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:15,401 INFO L225 Difference]: With dead ends: 20770 [2020-12-23 09:35:15,401 INFO L226 Difference]: Without dead ends: 13814 [2020-12-23 09:35:15,408 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:15,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13814 states. [2020-12-23 09:35:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13814 to 7100. [2020-12-23 09:35:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7100 states. [2020-12-23 09:35:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7100 states to 7100 states and 10095 transitions. [2020-12-23 09:35:15,929 INFO L78 Accepts]: Start accepts. Automaton has 7100 states and 10095 transitions. Word has length 279 [2020-12-23 09:35:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:15,929 INFO L481 AbstractCegarLoop]: Abstraction has 7100 states and 10095 transitions. [2020-12-23 09:35:15,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7100 states and 10095 transitions. [2020-12-23 09:35:15,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:15,935 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:15,936 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:15,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:35:15,936 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:15,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:15,937 INFO L82 PathProgramCache]: Analyzing trace with hash 831621293, now seen corresponding path program 1 times [2020-12-23 09:35:15,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:15,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724318449] [2020-12-23 09:35:15,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:16,040 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:16,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724318449] [2020-12-23 09:35:16,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:16,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:16,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729993258] [2020-12-23 09:35:16,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:16,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:16,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:16,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:16,042 INFO L87 Difference]: Start difference. First operand 7100 states and 10095 transitions. Second operand 5 states. [2020-12-23 09:35:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:17,115 INFO L93 Difference]: Finished difference Result 16851 states and 23960 transitions. [2020-12-23 09:35:17,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:17,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:17,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:17,131 INFO L225 Difference]: With dead ends: 16851 [2020-12-23 09:35:17,131 INFO L226 Difference]: Without dead ends: 9816 [2020-12-23 09:35:17,141 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:17,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9816 states. [2020-12-23 09:35:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9816 to 7112. [2020-12-23 09:35:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2020-12-23 09:35:17,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 10050 transitions. [2020-12-23 09:35:17,730 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 10050 transitions. Word has length 279 [2020-12-23 09:35:17,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:17,731 INFO L481 AbstractCegarLoop]: Abstraction has 7112 states and 10050 transitions. [2020-12-23 09:35:17,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:17,731 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 10050 transitions. [2020-12-23 09:35:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:17,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:17,736 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:17,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:35:17,737 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:17,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1814713423, now seen corresponding path program 1 times [2020-12-23 09:35:17,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:17,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683295746] [2020-12-23 09:35:17,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:17,844 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:17,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683295746] [2020-12-23 09:35:17,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:17,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:17,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922211690] [2020-12-23 09:35:17,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:17,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:17,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:17,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:17,846 INFO L87 Difference]: Start difference. First operand 7112 states and 10050 transitions. Second operand 5 states. [2020-12-23 09:35:19,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:19,543 INFO L93 Difference]: Finished difference Result 26357 states and 37400 transitions. [2020-12-23 09:35:19,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:19,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:19,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:19,564 INFO L225 Difference]: With dead ends: 26357 [2020-12-23 09:35:19,565 INFO L226 Difference]: Without dead ends: 19317 [2020-12-23 09:35:19,576 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:19,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19317 states. [2020-12-23 09:35:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19317 to 7295. [2020-12-23 09:35:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7295 states. [2020-12-23 09:35:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7295 states to 7295 states and 10233 transitions. [2020-12-23 09:35:20,412 INFO L78 Accepts]: Start accepts. Automaton has 7295 states and 10233 transitions. Word has length 279 [2020-12-23 09:35:20,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:20,412 INFO L481 AbstractCegarLoop]: Abstraction has 7295 states and 10233 transitions. [2020-12-23 09:35:20,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:20,412 INFO L276 IsEmpty]: Start isEmpty. Operand 7295 states and 10233 transitions. [2020-12-23 09:35:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:20,419 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:20,420 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:20,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 09:35:20,420 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:20,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:20,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1684848845, now seen corresponding path program 1 times [2020-12-23 09:35:20,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:20,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662469021] [2020-12-23 09:35:20,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:20,594 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:20,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662469021] [2020-12-23 09:35:20,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:20,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:20,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600012197] [2020-12-23 09:35:20,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:20,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:20,597 INFO L87 Difference]: Start difference. First operand 7295 states and 10233 transitions. Second operand 4 states. [2020-12-23 09:35:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:22,447 INFO L93 Difference]: Finished difference Result 24796 states and 34728 transitions. [2020-12-23 09:35:22,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:22,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2020-12-23 09:35:22,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:22,463 INFO L225 Difference]: With dead ends: 24796 [2020-12-23 09:35:22,464 INFO L226 Difference]: Without dead ends: 17578 [2020-12-23 09:35:22,473 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,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17578 states. [2020-12-23 09:35:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17578 to 13936. [2020-12-23 09:35:23,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13936 states. [2020-12-23 09:35:23,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13936 states to 13936 states and 19473 transitions. [2020-12-23 09:35:23,774 INFO L78 Accepts]: Start accepts. Automaton has 13936 states and 19473 transitions. Word has length 279 [2020-12-23 09:35:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:23,774 INFO L481 AbstractCegarLoop]: Abstraction has 13936 states and 19473 transitions. [2020-12-23 09:35:23,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:35:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13936 states and 19473 transitions. [2020-12-23 09:35:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:23,783 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:23,783 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:23,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 09:35:23,783 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:23,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:23,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1833167988, now seen corresponding path program 1 times [2020-12-23 09:35:23,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:23,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272276961] [2020-12-23 09:35:23,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:23,895 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:23,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272276961] [2020-12-23 09:35:23,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:23,895 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:23,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162987729] [2020-12-23 09:35:23,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:23,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:23,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:23,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:23,897 INFO L87 Difference]: Start difference. First operand 13936 states and 19473 transitions. Second operand 5 states. [2020-12-23 09:35:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:26,334 INFO L93 Difference]: Finished difference Result 39557 states and 55516 transitions. [2020-12-23 09:35:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:26,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:26,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:26,474 INFO L225 Difference]: With dead ends: 39557 [2020-12-23 09:35:26,475 INFO L226 Difference]: Without dead ends: 25702 [2020-12-23 09:35:26,485 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,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2020-12-23 09:35:27,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 14116. [2020-12-23 09:35:27,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14116 states. [2020-12-23 09:35:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14116 states to 14116 states and 19596 transitions. [2020-12-23 09:35:27,933 INFO L78 Accepts]: Start accepts. Automaton has 14116 states and 19596 transitions. Word has length 279 [2020-12-23 09:35:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:27,934 INFO L481 AbstractCegarLoop]: Abstraction has 14116 states and 19596 transitions. [2020-12-23 09:35:27,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 14116 states and 19596 transitions. [2020-12-23 09:35:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:27,942 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:27,942 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,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 09:35:27,943 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:27,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:27,943 INFO L82 PathProgramCache]: Analyzing trace with hash 697223542, now seen corresponding path program 1 times [2020-12-23 09:35:27,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:27,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021728419] [2020-12-23 09:35:27,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:28,039 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:28,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021728419] [2020-12-23 09:35:28,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:28,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:28,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192121473] [2020-12-23 09:35:28,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:28,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:28,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:28,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:28,042 INFO L87 Difference]: Start difference. First operand 14116 states and 19596 transitions. Second operand 5 states. [2020-12-23 09:35:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:31,443 INFO L93 Difference]: Finished difference Result 50475 states and 70550 transitions. [2020-12-23 09:35:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:31,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:31,480 INFO L225 Difference]: With dead ends: 50475 [2020-12-23 09:35:31,481 INFO L226 Difference]: Without dead ends: 36447 [2020-12-23 09:35:31,496 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:31,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36447 states. [2020-12-23 09:35:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36447 to 14467. [2020-12-23 09:35:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14467 states. [2020-12-23 09:35:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14467 states to 14467 states and 19947 transitions. [2020-12-23 09:35:33,049 INFO L78 Accepts]: Start accepts. Automaton has 14467 states and 19947 transitions. Word has length 279 [2020-12-23 09:35:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:33,050 INFO L481 AbstractCegarLoop]: Abstraction has 14467 states and 19947 transitions. [2020-12-23 09:35:33,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 14467 states and 19947 transitions. [2020-12-23 09:35:33,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:33,056 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:33,056 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:33,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 09:35:33,056 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:33,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:33,057 INFO L82 PathProgramCache]: Analyzing trace with hash 981209080, now seen corresponding path program 1 times [2020-12-23 09:35:33,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:33,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748870411] [2020-12-23 09:35:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:33,172 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:33,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748870411] [2020-12-23 09:35:33,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:33,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:35:33,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465355793] [2020-12-23 09:35:33,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:35:33,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:33,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:35:33,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:35:33,174 INFO L87 Difference]: Start difference. First operand 14467 states and 19947 transitions. Second operand 3 states. [2020-12-23 09:35:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:36,172 INFO L93 Difference]: Finished difference Result 42168 states and 58114 transitions. [2020-12-23 09:35:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:35:36,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2020-12-23 09:35:36,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:36,216 INFO L225 Difference]: With dead ends: 42168 [2020-12-23 09:35:36,216 INFO L226 Difference]: Without dead ends: 27794 [2020-12-23 09:35:36,229 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:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27794 states. [2020-12-23 09:35:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27794 to 27774. [2020-12-23 09:35:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27774 states. [2020-12-23 09:35:39,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27774 states to 27774 states and 38152 transitions. [2020-12-23 09:35:39,234 INFO L78 Accepts]: Start accepts. Automaton has 27774 states and 38152 transitions. Word has length 279 [2020-12-23 09:35:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:39,235 INFO L481 AbstractCegarLoop]: Abstraction has 27774 states and 38152 transitions. [2020-12-23 09:35:39,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:35:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 27774 states and 38152 transitions. [2020-12-23 09:35:39,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:39,245 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:39,245 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,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 09:35:39,245 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:39,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:39,245 INFO L82 PathProgramCache]: Analyzing trace with hash -304228679, now seen corresponding path program 1 times [2020-12-23 09:35:39,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:39,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492583354] [2020-12-23 09:35:39,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:39,358 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,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492583354] [2020-12-23 09:35:39,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:39,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:35:39,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96528233] [2020-12-23 09:35:39,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:35:39,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:39,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:35:39,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:35:39,360 INFO L87 Difference]: Start difference. First operand 27774 states and 38152 transitions. Second operand 5 states. [2020-12-23 09:35:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:44,706 INFO L93 Difference]: Finished difference Result 77147 states and 106580 transitions. [2020-12-23 09:35:44,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:35:44,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:35:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:44,754 INFO L225 Difference]: With dead ends: 77147 [2020-12-23 09:35:44,754 INFO L226 Difference]: Without dead ends: 49470 [2020-12-23 09:35:44,775 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:44,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49470 states. [2020-12-23 09:35:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49470 to 28122. [2020-12-23 09:35:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28122 states. [2020-12-23 09:35:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28122 states to 28122 states and 38391 transitions. [2020-12-23 09:35:48,223 INFO L78 Accepts]: Start accepts. Automaton has 28122 states and 38391 transitions. Word has length 279 [2020-12-23 09:35:48,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:35:48,223 INFO L481 AbstractCegarLoop]: Abstraction has 28122 states and 38391 transitions. [2020-12-23 09:35:48,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:35:48,224 INFO L276 IsEmpty]: Start isEmpty. Operand 28122 states and 38391 transitions. [2020-12-23 09:35:48,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:35:48,234 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:35:48,234 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:48,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 09:35:48,235 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:35:48,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:35:48,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1417528765, now seen corresponding path program 1 times [2020-12-23 09:35:48,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:35:48,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299549707] [2020-12-23 09:35:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:35:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:35:48,350 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:48,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299549707] [2020-12-23 09:35:48,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:35:48,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:35:48,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950952876] [2020-12-23 09:35:48,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:35:48,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:35:48,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:35:48,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:35:48,352 INFO L87 Difference]: Start difference. First operand 28122 states and 38391 transitions. Second operand 4 states. [2020-12-23 09:35:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:35:55,826 INFO L93 Difference]: Finished difference Result 96080 states and 130976 transitions. [2020-12-23 09:35:55,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:35:55,827 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2020-12-23 09:35:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:35:55,895 INFO L225 Difference]: With dead ends: 96080 [2020-12-23 09:35:55,896 INFO L226 Difference]: Without dead ends: 68057 [2020-12-23 09:35:55,918 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:55,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68057 states. [2020-12-23 09:36:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68057 to 54097. [2020-12-23 09:36:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54097 states. [2020-12-23 09:36:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54097 states to 54097 states and 73584 transitions. [2020-12-23 09:36:02,295 INFO L78 Accepts]: Start accepts. Automaton has 54097 states and 73584 transitions. Word has length 279 [2020-12-23 09:36:02,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:02,296 INFO L481 AbstractCegarLoop]: Abstraction has 54097 states and 73584 transitions. [2020-12-23 09:36:02,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:02,296 INFO L276 IsEmpty]: Start isEmpty. Operand 54097 states and 73584 transitions. [2020-12-23 09:36:02,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:36:02,314 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:02,314 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:02,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-12-23 09:36:02,314 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:02,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1966111681, now seen corresponding path program 1 times [2020-12-23 09:36:02,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:02,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082279931] [2020-12-23 09:36:02,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:02,568 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:02,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082279931] [2020-12-23 09:36:02,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:02,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:36:02,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188094618] [2020-12-23 09:36:02,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:36:02,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:02,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:36:02,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:36:02,574 INFO L87 Difference]: Start difference. First operand 54097 states and 73584 transitions. Second operand 5 states. [2020-12-23 09:36:13,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:13,017 INFO L93 Difference]: Finished difference Result 148875 states and 203790 transitions. [2020-12-23 09:36:13,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:36:13,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:36:13,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:13,113 INFO L225 Difference]: With dead ends: 148875 [2020-12-23 09:36:13,113 INFO L226 Difference]: Without dead ends: 94881 [2020-12-23 09:36:13,152 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:13,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94881 states. [2020-12-23 09:36:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94881 to 54769. [2020-12-23 09:36:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54769 states. [2020-12-23 09:36:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54769 states to 54769 states and 74047 transitions. [2020-12-23 09:36:20,060 INFO L78 Accepts]: Start accepts. Automaton has 54769 states and 74047 transitions. Word has length 279 [2020-12-23 09:36:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:20,060 INFO L481 AbstractCegarLoop]: Abstraction has 54769 states and 74047 transitions. [2020-12-23 09:36:20,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:36:20,061 INFO L276 IsEmpty]: Start isEmpty. Operand 54769 states and 74047 transitions. [2020-12-23 09:36:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:36:20,079 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:20,079 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:20,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-12-23 09:36:20,079 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:20,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:20,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1480587709, now seen corresponding path program 1 times [2020-12-23 09:36:20,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:20,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212035895] [2020-12-23 09:36:20,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:20,218 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:20,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212035895] [2020-12-23 09:36:20,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:20,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:20,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358851515] [2020-12-23 09:36:20,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:20,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:20,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:20,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:20,222 INFO L87 Difference]: Start difference. First operand 54769 states and 74047 transitions. Second operand 4 states. [2020-12-23 09:36:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:35,928 INFO L93 Difference]: Finished difference Result 186901 states and 252316 transitions. [2020-12-23 09:36:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:36:35,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2020-12-23 09:36:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:36,062 INFO L225 Difference]: With dead ends: 186901 [2020-12-23 09:36:36,062 INFO L226 Difference]: Without dead ends: 132244 [2020-12-23 09:36:36,107 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:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132244 states. [2020-12-23 09:36:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132244 to 105408. [2020-12-23 09:36:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105408 states. [2020-12-23 09:36:48,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105408 states to 105408 states and 142012 transitions. [2020-12-23 09:36:48,904 INFO L78 Accepts]: Start accepts. Automaton has 105408 states and 142012 transitions. Word has length 279 [2020-12-23 09:36:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:48,904 INFO L481 AbstractCegarLoop]: Abstraction has 105408 states and 142012 transitions. [2020-12-23 09:36:48,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 105408 states and 142012 transitions. [2020-12-23 09:36:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:36:48,928 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:48,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:36:48,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2020-12-23 09:36:48,929 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:48,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:48,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1542059973, now seen corresponding path program 1 times [2020-12-23 09:36:48,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:48,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146698074] [2020-12-23 09:36:48,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:49,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:36:49,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146698074] [2020-12-23 09:36:49,031 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:49,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:36:49,031 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124727277] [2020-12-23 09:36:49,032 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:36:49,032 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:49,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:36:49,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:36:49,033 INFO L87 Difference]: Start difference. First operand 105408 states and 142012 transitions. Second operand 5 states. [2020-12-23 09:37:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:10,214 INFO L93 Difference]: Finished difference Result 284228 states and 385306 transitions. [2020-12-23 09:37:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:10,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:37:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:10,492 INFO L225 Difference]: With dead ends: 284228 [2020-12-23 09:37:10,492 INFO L226 Difference]: Without dead ends: 178936 [2020-12-23 09:37:10,591 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:10,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178936 states. [2020-12-23 09:37:24,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178936 to 106704. [2020-12-23 09:37:24,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106704 states. [2020-12-23 09:37:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106704 states to 106704 states and 142907 transitions. [2020-12-23 09:37:24,602 INFO L78 Accepts]: Start accepts. Automaton has 106704 states and 142907 transitions. Word has length 279 [2020-12-23 09:37:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:24,603 INFO L481 AbstractCegarLoop]: Abstraction has 106704 states and 142907 transitions. [2020-12-23 09:37:24,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 106704 states and 142907 transitions. [2020-12-23 09:37:24,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2020-12-23 09:37:24,639 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:24,639 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:24,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2020-12-23 09:37:24,640 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash -466985015, now seen corresponding path program 1 times [2020-12-23 09:37:24,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:24,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509348113] [2020-12-23 09:37:24,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:24,745 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:24,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509348113] [2020-12-23 09:37:24,746 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:24,746 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:24,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689973837] [2020-12-23 09:37:24,746 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:24,747 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:24,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:24,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:24,747 INFO L87 Difference]: Start difference. First operand 106704 states and 142907 transitions. Second operand 5 states. [2020-12-23 09:37:54,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:54,476 INFO L93 Difference]: Finished difference Result 351026 states and 474159 transitions. [2020-12-23 09:37:54,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:54,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2020-12-23 09:37:54,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:54,988 INFO L225 Difference]: With dead ends: 351026 [2020-12-23 09:37:54,988 INFO L226 Difference]: Without dead ends: 244445 [2020-12-23 09:37:55,122 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:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244445 states.