/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.09.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:27:09,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:27:09,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:27:09,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:27:09,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:27:09,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:27:09,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:27:09,855 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:27:09,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:27:09,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:27:09,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:27:09,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:27:09,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:27:09,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:27:09,865 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:27:09,867 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:27:09,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:27:09,878 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:27:09,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:27:09,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:27:09,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:27:09,890 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:27:09,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:27:09,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:27:09,904 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:27:09,905 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:27:09,905 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:27:09,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:27:09,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:27:09,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:27:09,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:27:09,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:27:09,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:27:09,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:27:09,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:27:09,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:27:09,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:27:09,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:27:09,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:27:09,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:27:09,931 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:27:09,932 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:27:09,976 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:27:09,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:27:09,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:27:09,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:27:09,979 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:27:09,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:27:09,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:27:09,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:27:09,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:27:09,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:27:09,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:27:09,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:27:09,981 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:27:09,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:27:09,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:27:09,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:27:09,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:27:09,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:27:09,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:27:09,983 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:27:09,983 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:27:09,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:27:09,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:27:09,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:27:09,984 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:27:09,985 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 [2021-01-06 19:27:10,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:27:10,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:27:10,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:27:10,407 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:27:10,408 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:27:10,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.09.cil-1.c [2021-01-06 19:27:10,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/22cbbf1c5/329065c451074a5a975d600ad1c2f01c/FLAG9aa5e4477 [2021-01-06 19:27:11,239 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:27:11,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.09.cil-1.c [2021-01-06 19:27:11,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/22cbbf1c5/329065c451074a5a975d600ad1c2f01c/FLAG9aa5e4477 [2021-01-06 19:27:11,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/22cbbf1c5/329065c451074a5a975d600ad1c2f01c [2021-01-06 19:27:11,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:27:11,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:27:11,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:27:11,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:27:11,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:27:11,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:27:11" (1/1) ... [2021-01-06 19:27:11,297 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f45b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:11, skipping insertion in model container [2021-01-06 19:27:11,297 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:27:11" (1/1) ... [2021-01-06 19:27:11,307 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:27:11,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:27:11,572 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.09.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_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[~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[~__retres1~10,] 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~10,] 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~10,] 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~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] 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[~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[~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[~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[~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[~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[~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[~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[~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[~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~11,] [2021-01-06 19:27:11,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:27:11,836 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:27:11,853 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.09.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_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[~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[~__retres1~10,] 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~10,] 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~10,] 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~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] 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[~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[~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[~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[~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[~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[~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[~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[~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[~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~11,] [2021-01-06 19:27:11,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:27:12,017 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:27:12,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12 WrapperNode [2021-01-06 19:27:12,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:27:12,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:27:12,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:27:12,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:27:12,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (1/1) ... [2021-01-06 19:27:12,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (1/1) ... [2021-01-06 19:27:12,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:27:12,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:27:12,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:27:12,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:27:12,237 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (1/1) ... [2021-01-06 19:27:12,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (1/1) ... [2021-01-06 19:27:12,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (1/1) ... [2021-01-06 19:27:12,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (1/1) ... [2021-01-06 19:27:12,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (1/1) ... [2021-01-06 19:27:12,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (1/1) ... [2021-01-06 19:27:12,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (1/1) ... [2021-01-06 19:27:12,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:27:12,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:27:12,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:27:12,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:27:12,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (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 [2021-01-06 19:27:12,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:27:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:27:12,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:27:12,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:27:15,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:27:15,292 INFO L299 CfgBuilder]: Removed 376 assume(true) statements. [2021-01-06 19:27:15,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:27:15 BoogieIcfgContainer [2021-01-06 19:27:15,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:27:15,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:27:15,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:27:15,303 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:27:15,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:27:11" (1/3) ... [2021-01-06 19:27:15,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f8897a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:27:15, skipping insertion in model container [2021-01-06 19:27:15,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:12" (2/3) ... [2021-01-06 19:27:15,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f8897a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:27:15, skipping insertion in model container [2021-01-06 19:27:15,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:27:15" (3/3) ... [2021-01-06 19:27:15,307 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.09.cil-1.c [2021-01-06 19:27:15,314 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:27:15,321 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:27:15,342 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:27:15,380 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:27:15,380 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:27:15,380 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:27:15,380 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:27:15,381 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:27:15,381 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:27:15,381 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:27:15,381 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:27:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states. [2021-01-06 19:27:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:15,446 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:15,448 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] [2021-01-06 19:27:15,449 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:15,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash 63539704, now seen corresponding path program 1 times [2021-01-06 19:27:15,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:15,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940765008] [2021-01-06 19:27:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:15,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:15,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940765008] [2021-01-06 19:27:15,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:15,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:15,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138361353] [2021-01-06 19:27:15,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:15,930 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:15,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:15,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:15,954 INFO L87 Difference]: Start difference. First operand 1149 states. Second operand 3 states. [2021-01-06 19:27:16,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:16,125 INFO L93 Difference]: Finished difference Result 2293 states and 3487 transitions. [2021-01-06 19:27:16,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:16,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 19:27:16,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:16,152 INFO L225 Difference]: With dead ends: 2293 [2021-01-06 19:27:16,152 INFO L226 Difference]: Without dead ends: 1145 [2021-01-06 19:27:16,167 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 [2021-01-06 19:27:16,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2021-01-06 19:27:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1145. [2021-01-06 19:27:16,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2021-01-06 19:27:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1717 transitions. [2021-01-06 19:27:16,320 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1717 transitions. Word has length 127 [2021-01-06 19:27:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:16,321 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1717 transitions. [2021-01-06 19:27:16,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1717 transitions. [2021-01-06 19:27:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:16,329 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:16,330 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] [2021-01-06 19:27:16,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:27:16,331 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash -798293898, now seen corresponding path program 1 times [2021-01-06 19:27:16,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:16,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205085016] [2021-01-06 19:27:16,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:16,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205085016] [2021-01-06 19:27:16,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:16,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:16,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013790257] [2021-01-06 19:27:16,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:16,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:16,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:16,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:16,519 INFO L87 Difference]: Start difference. First operand 1145 states and 1717 transitions. Second operand 3 states. [2021-01-06 19:27:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:16,579 INFO L93 Difference]: Finished difference Result 2277 states and 3412 transitions. [2021-01-06 19:27:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:16,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 19:27:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:16,586 INFO L225 Difference]: With dead ends: 2277 [2021-01-06 19:27:16,586 INFO L226 Difference]: Without dead ends: 1145 [2021-01-06 19:27:16,589 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 [2021-01-06 19:27:16,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2021-01-06 19:27:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1145. [2021-01-06 19:27:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1145 states. [2021-01-06 19:27:16,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1716 transitions. [2021-01-06 19:27:16,634 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1716 transitions. Word has length 127 [2021-01-06 19:27:16,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:16,635 INFO L481 AbstractCegarLoop]: Abstraction has 1145 states and 1716 transitions. [2021-01-06 19:27:16,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:16,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1716 transitions. [2021-01-06 19:27:16,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:16,665 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:16,665 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] [2021-01-06 19:27:16,665 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:27:16,666 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1567741172, now seen corresponding path program 1 times [2021-01-06 19:27:16,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:16,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93469580] [2021-01-06 19:27:16,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:16,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93469580] [2021-01-06 19:27:16,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:16,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:16,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435637540] [2021-01-06 19:27:16,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:16,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:16,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:16,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:16,835 INFO L87 Difference]: Start difference. First operand 1145 states and 1716 transitions. Second operand 3 states. [2021-01-06 19:27:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:16,964 INFO L93 Difference]: Finished difference Result 3227 states and 4822 transitions. [2021-01-06 19:27:16,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:16,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 19:27:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:16,976 INFO L225 Difference]: With dead ends: 3227 [2021-01-06 19:27:16,976 INFO L226 Difference]: Without dead ends: 2096 [2021-01-06 19:27:16,979 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 [2021-01-06 19:27:16,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2096 states. [2021-01-06 19:27:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2096 to 2094. [2021-01-06 19:27:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3124 transitions. [2021-01-06 19:27:17,074 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3124 transitions. Word has length 127 [2021-01-06 19:27:17,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:17,075 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3124 transitions. [2021-01-06 19:27:17,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3124 transitions. [2021-01-06 19:27:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:17,077 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:17,077 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] [2021-01-06 19:27:17,078 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:27:17,078 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:17,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1325644144, now seen corresponding path program 1 times [2021-01-06 19:27:17,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:17,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408344059] [2021-01-06 19:27:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:17,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408344059] [2021-01-06 19:27:17,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:17,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:17,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777615521] [2021-01-06 19:27:17,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:17,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:17,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:17,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:17,155 INFO L87 Difference]: Start difference. First operand 2094 states and 3124 transitions. Second operand 4 states. [2021-01-06 19:27:17,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:17,442 INFO L93 Difference]: Finished difference Result 5123 states and 7633 transitions. [2021-01-06 19:27:17,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:17,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:17,460 INFO L225 Difference]: With dead ends: 5123 [2021-01-06 19:27:17,460 INFO L226 Difference]: Without dead ends: 3044 [2021-01-06 19:27:17,467 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 [2021-01-06 19:27:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3044 states. [2021-01-06 19:27:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 2094. [2021-01-06 19:27:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3121 transitions. [2021-01-06 19:27:17,605 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3121 transitions. Word has length 127 [2021-01-06 19:27:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:17,605 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3121 transitions. [2021-01-06 19:27:17,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3121 transitions. [2021-01-06 19:27:17,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:17,608 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:17,608 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] [2021-01-06 19:27:17,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:27:17,609 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:17,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1242178190, now seen corresponding path program 1 times [2021-01-06 19:27:17,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:17,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350161116] [2021-01-06 19:27:17,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:17,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:17,735 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350161116] [2021-01-06 19:27:17,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:17,735 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:17,735 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623442369] [2021-01-06 19:27:17,736 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:17,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:17,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:17,740 INFO L87 Difference]: Start difference. First operand 2094 states and 3121 transitions. Second operand 4 states. [2021-01-06 19:27:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:18,009 INFO L93 Difference]: Finished difference Result 5121 states and 7623 transitions. [2021-01-06 19:27:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:18,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:18,027 INFO L225 Difference]: With dead ends: 5121 [2021-01-06 19:27:18,028 INFO L226 Difference]: Without dead ends: 3043 [2021-01-06 19:27:18,032 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 [2021-01-06 19:27:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2021-01-06 19:27:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2094. [2021-01-06 19:27:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:18,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3118 transitions. [2021-01-06 19:27:18,183 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3118 transitions. Word has length 127 [2021-01-06 19:27:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:18,183 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3118 transitions. [2021-01-06 19:27:18,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:18,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3118 transitions. [2021-01-06 19:27:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:18,185 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:18,185 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] [2021-01-06 19:27:18,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:27:18,186 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:18,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:18,186 INFO L82 PathProgramCache]: Analyzing trace with hash -770821840, now seen corresponding path program 1 times [2021-01-06 19:27:18,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:18,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463444372] [2021-01-06 19:27:18,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:18,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:18,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463444372] [2021-01-06 19:27:18,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:18,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:18,252 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202753083] [2021-01-06 19:27:18,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:18,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:18,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:18,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:18,255 INFO L87 Difference]: Start difference. First operand 2094 states and 3118 transitions. Second operand 4 states. [2021-01-06 19:27:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:18,515 INFO L93 Difference]: Finished difference Result 5119 states and 7613 transitions. [2021-01-06 19:27:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:18,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:18,532 INFO L225 Difference]: With dead ends: 5119 [2021-01-06 19:27:18,532 INFO L226 Difference]: Without dead ends: 3042 [2021-01-06 19:27:18,537 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 [2021-01-06 19:27:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3042 states. [2021-01-06 19:27:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3042 to 2094. [2021-01-06 19:27:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:18,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3115 transitions. [2021-01-06 19:27:18,673 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3115 transitions. Word has length 127 [2021-01-06 19:27:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:18,674 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3115 transitions. [2021-01-06 19:27:18,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3115 transitions. [2021-01-06 19:27:18,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:18,675 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:18,676 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] [2021-01-06 19:27:18,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:27:18,676 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:18,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1876782514, now seen corresponding path program 1 times [2021-01-06 19:27:18,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:18,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680188333] [2021-01-06 19:27:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:18,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:18,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680188333] [2021-01-06 19:27:18,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:18,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:18,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404724923] [2021-01-06 19:27:18,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:18,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:18,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:18,802 INFO L87 Difference]: Start difference. First operand 2094 states and 3115 transitions. Second operand 3 states. [2021-01-06 19:27:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:18,942 INFO L93 Difference]: Finished difference Result 4170 states and 6203 transitions. [2021-01-06 19:27:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:18,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 19:27:18,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:18,955 INFO L225 Difference]: With dead ends: 4170 [2021-01-06 19:27:18,955 INFO L226 Difference]: Without dead ends: 2094 [2021-01-06 19:27:18,960 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 [2021-01-06 19:27:18,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2021-01-06 19:27:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2021-01-06 19:27:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3107 transitions. [2021-01-06 19:27:19,086 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3107 transitions. Word has length 127 [2021-01-06 19:27:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:19,086 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3107 transitions. [2021-01-06 19:27:19,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3107 transitions. [2021-01-06 19:27:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:19,088 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:19,088 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] [2021-01-06 19:27:19,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:27:19,088 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash -231935954, now seen corresponding path program 1 times [2021-01-06 19:27:19,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:19,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327827810] [2021-01-06 19:27:19,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:19,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:19,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327827810] [2021-01-06 19:27:19,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:19,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:19,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703610089] [2021-01-06 19:27:19,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:19,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:19,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:19,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:19,154 INFO L87 Difference]: Start difference. First operand 2094 states and 3107 transitions. Second operand 3 states. [2021-01-06 19:27:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:19,307 INFO L93 Difference]: Finished difference Result 4169 states and 6186 transitions. [2021-01-06 19:27:19,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:19,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 19:27:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:19,318 INFO L225 Difference]: With dead ends: 4169 [2021-01-06 19:27:19,318 INFO L226 Difference]: Without dead ends: 2094 [2021-01-06 19:27:19,322 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 [2021-01-06 19:27:19,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2021-01-06 19:27:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2021-01-06 19:27:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:19,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3099 transitions. [2021-01-06 19:27:19,453 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3099 transitions. Word has length 127 [2021-01-06 19:27:19,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:19,454 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3099 transitions. [2021-01-06 19:27:19,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3099 transitions. [2021-01-06 19:27:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:19,455 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:19,456 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] [2021-01-06 19:27:19,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:27:19,456 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:19,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash 115682866, now seen corresponding path program 1 times [2021-01-06 19:27:19,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:19,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405009723] [2021-01-06 19:27:19,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:19,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405009723] [2021-01-06 19:27:19,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:19,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:19,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983325414] [2021-01-06 19:27:19,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:19,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:19,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:19,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:19,560 INFO L87 Difference]: Start difference. First operand 2094 states and 3099 transitions. Second operand 4 states. [2021-01-06 19:27:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:19,868 INFO L93 Difference]: Finished difference Result 5113 states and 7561 transitions. [2021-01-06 19:27:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:19,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:19,885 INFO L225 Difference]: With dead ends: 5113 [2021-01-06 19:27:19,885 INFO L226 Difference]: Without dead ends: 3039 [2021-01-06 19:27:19,891 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 [2021-01-06 19:27:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2021-01-06 19:27:20,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 2094. [2021-01-06 19:27:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:20,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3096 transitions. [2021-01-06 19:27:20,110 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3096 transitions. Word has length 127 [2021-01-06 19:27:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:20,112 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3096 transitions. [2021-01-06 19:27:20,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3096 transitions. [2021-01-06 19:27:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:20,113 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:20,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:20,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:27:20,114 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1857482512, now seen corresponding path program 1 times [2021-01-06 19:27:20,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:20,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605463043] [2021-01-06 19:27:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:20,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:20,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605463043] [2021-01-06 19:27:20,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:20,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:20,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331502064] [2021-01-06 19:27:20,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:20,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:20,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:20,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:20,195 INFO L87 Difference]: Start difference. First operand 2094 states and 3096 transitions. Second operand 4 states. [2021-01-06 19:27:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:20,483 INFO L93 Difference]: Finished difference Result 5109 states and 7547 transitions. [2021-01-06 19:27:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:20,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:20,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:20,501 INFO L225 Difference]: With dead ends: 5109 [2021-01-06 19:27:20,502 INFO L226 Difference]: Without dead ends: 3037 [2021-01-06 19:27:20,507 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 [2021-01-06 19:27:20,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3037 states. [2021-01-06 19:27:20,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3037 to 2094. [2021-01-06 19:27:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:20,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3093 transitions. [2021-01-06 19:27:20,681 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3093 transitions. Word has length 127 [2021-01-06 19:27:20,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:20,681 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3093 transitions. [2021-01-06 19:27:20,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3093 transitions. [2021-01-06 19:27:20,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:20,683 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:20,683 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] [2021-01-06 19:27:20,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:27:20,684 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:20,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1814203182, now seen corresponding path program 1 times [2021-01-06 19:27:20,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:20,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340042014] [2021-01-06 19:27:20,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:20,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340042014] [2021-01-06 19:27:20,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:20,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:20,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205602831] [2021-01-06 19:27:20,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:20,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:20,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:20,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:20,746 INFO L87 Difference]: Start difference. First operand 2094 states and 3093 transitions. Second operand 4 states. [2021-01-06 19:27:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:21,016 INFO L93 Difference]: Finished difference Result 5107 states and 7537 transitions. [2021-01-06 19:27:21,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:21,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:21,032 INFO L225 Difference]: With dead ends: 5107 [2021-01-06 19:27:21,033 INFO L226 Difference]: Without dead ends: 3036 [2021-01-06 19:27:21,038 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 [2021-01-06 19:27:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2021-01-06 19:27:21,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2094. [2021-01-06 19:27:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:21,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3090 transitions. [2021-01-06 19:27:21,170 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3090 transitions. Word has length 127 [2021-01-06 19:27:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:21,171 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3090 transitions. [2021-01-06 19:27:21,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3090 transitions. [2021-01-06 19:27:21,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:21,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:21,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] [2021-01-06 19:27:21,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:27:21,173 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:21,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:21,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1932644656, now seen corresponding path program 1 times [2021-01-06 19:27:21,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:21,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198186551] [2021-01-06 19:27:21,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:21,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198186551] [2021-01-06 19:27:21,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:21,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:21,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131099818] [2021-01-06 19:27:21,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:21,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:21,247 INFO L87 Difference]: Start difference. First operand 2094 states and 3090 transitions. Second operand 4 states. [2021-01-06 19:27:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:21,658 INFO L93 Difference]: Finished difference Result 5035 states and 7427 transitions. [2021-01-06 19:27:21,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:21,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:21,668 INFO L225 Difference]: With dead ends: 5035 [2021-01-06 19:27:21,668 INFO L226 Difference]: Without dead ends: 2965 [2021-01-06 19:27:21,673 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 [2021-01-06 19:27:21,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2965 states. [2021-01-06 19:27:21,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2965 to 2094. [2021-01-06 19:27:21,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3087 transitions. [2021-01-06 19:27:21,815 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3087 transitions. Word has length 127 [2021-01-06 19:27:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:21,815 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3087 transitions. [2021-01-06 19:27:21,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3087 transitions. [2021-01-06 19:27:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:21,817 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:21,817 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] [2021-01-06 19:27:21,817 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:27:21,817 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:21,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:21,818 INFO L82 PathProgramCache]: Analyzing trace with hash -973028626, now seen corresponding path program 1 times [2021-01-06 19:27:21,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:21,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634219020] [2021-01-06 19:27:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:21,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:21,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634219020] [2021-01-06 19:27:21,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:21,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:21,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499494278] [2021-01-06 19:27:21,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:21,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:21,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:21,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:21,894 INFO L87 Difference]: Start difference. First operand 2094 states and 3087 transitions. Second operand 4 states. [2021-01-06 19:27:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:22,281 INFO L93 Difference]: Finished difference Result 5033 states and 7417 transitions. [2021-01-06 19:27:22,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:22,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:22,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:22,290 INFO L225 Difference]: With dead ends: 5033 [2021-01-06 19:27:22,290 INFO L226 Difference]: Without dead ends: 2964 [2021-01-06 19:27:22,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2021-01-06 19:27:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2094. [2021-01-06 19:27:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:22,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3084 transitions. [2021-01-06 19:27:22,440 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3084 transitions. Word has length 127 [2021-01-06 19:27:22,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:22,441 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3084 transitions. [2021-01-06 19:27:22,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3084 transitions. [2021-01-06 19:27:22,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:22,442 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:22,443 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] [2021-01-06 19:27:22,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:27:22,443 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:22,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1288544624, now seen corresponding path program 1 times [2021-01-06 19:27:22,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:22,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860957923] [2021-01-06 19:27:22,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:22,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860957923] [2021-01-06 19:27:22,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:22,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:22,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273237695] [2021-01-06 19:27:22,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:22,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:22,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:22,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:22,526 INFO L87 Difference]: Start difference. First operand 2094 states and 3084 transitions. Second operand 3 states. [2021-01-06 19:27:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:22,744 INFO L93 Difference]: Finished difference Result 4162 states and 6132 transitions. [2021-01-06 19:27:22,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:22,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 19:27:22,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:22,751 INFO L225 Difference]: With dead ends: 4162 [2021-01-06 19:27:22,752 INFO L226 Difference]: Without dead ends: 2094 [2021-01-06 19:27:22,757 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 [2021-01-06 19:27:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2021-01-06 19:27:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2094. [2021-01-06 19:27:22,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3054 transitions. [2021-01-06 19:27:22,896 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3054 transitions. Word has length 127 [2021-01-06 19:27:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:22,897 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3054 transitions. [2021-01-06 19:27:22,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:22,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3054 transitions. [2021-01-06 19:27:22,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:22,898 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:22,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:22,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:27:22,899 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:22,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:22,900 INFO L82 PathProgramCache]: Analyzing trace with hash -359309332, now seen corresponding path program 1 times [2021-01-06 19:27:22,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:22,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334669500] [2021-01-06 19:27:22,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:22,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:22,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334669500] [2021-01-06 19:27:22,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:22,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:22,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792647317] [2021-01-06 19:27:22,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:22,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:22,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:22,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:22,948 INFO L87 Difference]: Start difference. First operand 2094 states and 3054 transitions. Second operand 4 states. [2021-01-06 19:27:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:23,295 INFO L93 Difference]: Finished difference Result 5029 states and 7333 transitions. [2021-01-06 19:27:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:23,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:23,302 INFO L225 Difference]: With dead ends: 5029 [2021-01-06 19:27:23,302 INFO L226 Difference]: Without dead ends: 2962 [2021-01-06 19:27:23,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:23,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2962 states. [2021-01-06 19:27:23,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2962 to 2094. [2021-01-06 19:27:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3051 transitions. [2021-01-06 19:27:23,448 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3051 transitions. Word has length 127 [2021-01-06 19:27:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:23,448 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3051 transitions. [2021-01-06 19:27:23,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3051 transitions. [2021-01-06 19:27:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:23,450 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:23,450 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] [2021-01-06 19:27:23,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:27:23,451 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:23,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:23,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1666451730, now seen corresponding path program 1 times [2021-01-06 19:27:23,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:23,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254994116] [2021-01-06 19:27:23,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:23,500 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254994116] [2021-01-06 19:27:23,500 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:23,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:23,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189623488] [2021-01-06 19:27:23,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:23,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:23,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:23,502 INFO L87 Difference]: Start difference. First operand 2094 states and 3051 transitions. Second operand 4 states. [2021-01-06 19:27:23,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:23,867 INFO L93 Difference]: Finished difference Result 5027 states and 7323 transitions. [2021-01-06 19:27:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:23,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:23,875 INFO L225 Difference]: With dead ends: 5027 [2021-01-06 19:27:23,875 INFO L226 Difference]: Without dead ends: 2961 [2021-01-06 19:27:23,879 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 [2021-01-06 19:27:23,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2961 states. [2021-01-06 19:27:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2094. [2021-01-06 19:27:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:24,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3048 transitions. [2021-01-06 19:27:24,031 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3048 transitions. Word has length 127 [2021-01-06 19:27:24,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:24,031 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3048 transitions. [2021-01-06 19:27:24,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:24,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3048 transitions. [2021-01-06 19:27:24,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:24,033 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:24,033 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] [2021-01-06 19:27:24,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:27:24,033 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:24,034 INFO L82 PathProgramCache]: Analyzing trace with hash 231045036, now seen corresponding path program 1 times [2021-01-06 19:27:24,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:24,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095126583] [2021-01-06 19:27:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:24,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095126583] [2021-01-06 19:27:24,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:24,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:24,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077285058] [2021-01-06 19:27:24,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:24,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:24,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:24,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:24,104 INFO L87 Difference]: Start difference. First operand 2094 states and 3048 transitions. Second operand 4 states. [2021-01-06 19:27:24,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:24,462 INFO L93 Difference]: Finished difference Result 5023 states and 7309 transitions. [2021-01-06 19:27:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:24,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:24,477 INFO L225 Difference]: With dead ends: 5023 [2021-01-06 19:27:24,477 INFO L226 Difference]: Without dead ends: 2959 [2021-01-06 19:27:24,486 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 [2021-01-06 19:27:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2959 states. [2021-01-06 19:27:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2959 to 2094. [2021-01-06 19:27:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3045 transitions. [2021-01-06 19:27:24,680 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3045 transitions. Word has length 127 [2021-01-06 19:27:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:24,680 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3045 transitions. [2021-01-06 19:27:24,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3045 transitions. [2021-01-06 19:27:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:24,682 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:24,682 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] [2021-01-06 19:27:24,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:27:24,682 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:24,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1675358230, now seen corresponding path program 1 times [2021-01-06 19:27:24,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:24,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834475853] [2021-01-06 19:27:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:24,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834475853] [2021-01-06 19:27:24,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:24,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:24,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589485120] [2021-01-06 19:27:24,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:24,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:24,746 INFO L87 Difference]: Start difference. First operand 2094 states and 3045 transitions. Second operand 4 states. [2021-01-06 19:27:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:25,116 INFO L93 Difference]: Finished difference Result 5021 states and 7299 transitions. [2021-01-06 19:27:25,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:25,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:25,123 INFO L225 Difference]: With dead ends: 5021 [2021-01-06 19:27:25,124 INFO L226 Difference]: Without dead ends: 2958 [2021-01-06 19:27:25,128 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 [2021-01-06 19:27:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2021-01-06 19:27:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2094. [2021-01-06 19:27:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:25,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3042 transitions. [2021-01-06 19:27:25,342 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3042 transitions. Word has length 127 [2021-01-06 19:27:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:25,342 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3042 transitions. [2021-01-06 19:27:25,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:25,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3042 transitions. [2021-01-06 19:27:25,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:25,344 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:25,344 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] [2021-01-06 19:27:25,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:27:25,345 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:25,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:25,345 INFO L82 PathProgramCache]: Analyzing trace with hash -74287124, now seen corresponding path program 1 times [2021-01-06 19:27:25,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:25,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658831294] [2021-01-06 19:27:25,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:25,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658831294] [2021-01-06 19:27:25,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:25,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:25,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219467208] [2021-01-06 19:27:25,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:25,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:25,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:25,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:25,411 INFO L87 Difference]: Start difference. First operand 2094 states and 3042 transitions. Second operand 4 states. [2021-01-06 19:27:25,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:25,799 INFO L93 Difference]: Finished difference Result 5019 states and 7289 transitions. [2021-01-06 19:27:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:25,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:25,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:25,807 INFO L225 Difference]: With dead ends: 5019 [2021-01-06 19:27:25,807 INFO L226 Difference]: Without dead ends: 2957 [2021-01-06 19:27:25,811 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 [2021-01-06 19:27:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2021-01-06 19:27:26,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2094. [2021-01-06 19:27:26,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3039 transitions. [2021-01-06 19:27:26,019 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3039 transitions. Word has length 127 [2021-01-06 19:27:26,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:26,019 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3039 transitions. [2021-01-06 19:27:26,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:26,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3039 transitions. [2021-01-06 19:27:26,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:26,020 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:26,021 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] [2021-01-06 19:27:26,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:27:26,021 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:26,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:26,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1131018326, now seen corresponding path program 1 times [2021-01-06 19:27:26,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:26,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705196446] [2021-01-06 19:27:26,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:26,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:26,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705196446] [2021-01-06 19:27:26,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:26,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:26,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664605027] [2021-01-06 19:27:26,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:26,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:26,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:26,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:26,095 INFO L87 Difference]: Start difference. First operand 2094 states and 3039 transitions. Second operand 4 states. [2021-01-06 19:27:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:26,464 INFO L93 Difference]: Finished difference Result 5017 states and 7279 transitions. [2021-01-06 19:27:26,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:26,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:26,472 INFO L225 Difference]: With dead ends: 5017 [2021-01-06 19:27:26,472 INFO L226 Difference]: Without dead ends: 2956 [2021-01-06 19:27:26,476 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 [2021-01-06 19:27:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2021-01-06 19:27:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2094. [2021-01-06 19:27:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2021-01-06 19:27:26,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 3036 transitions. [2021-01-06 19:27:26,631 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 3036 transitions. Word has length 127 [2021-01-06 19:27:26,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:26,632 INFO L481 AbstractCegarLoop]: Abstraction has 2094 states and 3036 transitions. [2021-01-06 19:27:26,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:26,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 3036 transitions. [2021-01-06 19:27:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:27:26,633 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:26,633 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] [2021-01-06 19:27:26,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:27:26,633 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:26,634 INFO L82 PathProgramCache]: Analyzing trace with hash 220366892, now seen corresponding path program 1 times [2021-01-06 19:27:26,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:26,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18617993] [2021-01-06 19:27:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:26,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18617993] [2021-01-06 19:27:26,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:26,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:26,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751453643] [2021-01-06 19:27:26,686 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:26,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:26,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:26,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:26,687 INFO L87 Difference]: Start difference. First operand 2094 states and 3036 transitions. Second operand 4 states. [2021-01-06 19:27:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:27,511 INFO L93 Difference]: Finished difference Result 7864 states and 11375 transitions. [2021-01-06 19:27:27,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:27,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:27:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:27,526 INFO L225 Difference]: With dead ends: 7864 [2021-01-06 19:27:27,527 INFO L226 Difference]: Without dead ends: 5805 [2021-01-06 19:27:27,533 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 [2021-01-06 19:27:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5805 states. [2021-01-06 19:27:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5805 to 5535. [2021-01-06 19:27:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5535 states. [2021-01-06 19:27:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5535 states to 5535 states and 7943 transitions. [2021-01-06 19:27:27,979 INFO L78 Accepts]: Start accepts. Automaton has 5535 states and 7943 transitions. Word has length 127 [2021-01-06 19:27:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:27,980 INFO L481 AbstractCegarLoop]: Abstraction has 5535 states and 7943 transitions. [2021-01-06 19:27:27,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:27,980 INFO L276 IsEmpty]: Start isEmpty. Operand 5535 states and 7943 transitions. [2021-01-06 19:27:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 19:27:27,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:27,982 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:27:27,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:27:27,983 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:27,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:27,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2100467592, now seen corresponding path program 1 times [2021-01-06 19:27:27,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:27,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816502484] [2021-01-06 19:27:27,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:28,043 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816502484] [2021-01-06 19:27:28,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:28,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:27:28,044 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938177] [2021-01-06 19:27:28,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:27:28,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:28,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:27:28,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:28,045 INFO L87 Difference]: Start difference. First operand 5535 states and 7943 transitions. Second operand 5 states. [2021-01-06 19:27:29,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:29,263 INFO L93 Difference]: Finished difference Result 14599 states and 20993 transitions. [2021-01-06 19:27:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:27:29,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2021-01-06 19:27:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:29,285 INFO L225 Difference]: With dead ends: 14599 [2021-01-06 19:27:29,286 INFO L226 Difference]: Without dead ends: 9109 [2021-01-06 19:27:29,296 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 [2021-01-06 19:27:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9109 states. [2021-01-06 19:27:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9109 to 5604. [2021-01-06 19:27:29,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5604 states. [2021-01-06 19:27:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5604 states to 5604 states and 7971 transitions. [2021-01-06 19:27:29,914 INFO L78 Accepts]: Start accepts. Automaton has 5604 states and 7971 transitions. Word has length 147 [2021-01-06 19:27:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:29,914 INFO L481 AbstractCegarLoop]: Abstraction has 5604 states and 7971 transitions. [2021-01-06 19:27:29,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:27:29,915 INFO L276 IsEmpty]: Start isEmpty. Operand 5604 states and 7971 transitions. [2021-01-06 19:27:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 19:27:29,917 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:29,917 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:27:29,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:27:29,918 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:29,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:29,919 INFO L82 PathProgramCache]: Analyzing trace with hash 67073546, now seen corresponding path program 1 times [2021-01-06 19:27:29,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:29,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772690295] [2021-01-06 19:27:29,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:29,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772690295] [2021-01-06 19:27:29,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:29,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:27:29,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422730919] [2021-01-06 19:27:29,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:27:29,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:27:29,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:29,985 INFO L87 Difference]: Start difference. First operand 5604 states and 7971 transitions. Second operand 5 states. [2021-01-06 19:27:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:30,797 INFO L93 Difference]: Finished difference Result 12272 states and 17427 transitions. [2021-01-06 19:27:30,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:27:30,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2021-01-06 19:27:30,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:30,814 INFO L225 Difference]: With dead ends: 12272 [2021-01-06 19:27:30,814 INFO L226 Difference]: Without dead ends: 6720 [2021-01-06 19:27:30,824 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 [2021-01-06 19:27:30,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6720 states. [2021-01-06 19:27:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6720 to 5610. [2021-01-06 19:27:31,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5610 states. [2021-01-06 19:27:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5610 states to 5610 states and 7915 transitions. [2021-01-06 19:27:31,379 INFO L78 Accepts]: Start accepts. Automaton has 5610 states and 7915 transitions. Word has length 147 [2021-01-06 19:27:31,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:31,379 INFO L481 AbstractCegarLoop]: Abstraction has 5610 states and 7915 transitions. [2021-01-06 19:27:31,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:27:31,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5610 states and 7915 transitions. [2021-01-06 19:27:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-01-06 19:27:31,381 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:31,381 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:27:31,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:27:31,381 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:31,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1668144652, now seen corresponding path program 1 times [2021-01-06 19:27:31,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:31,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293986611] [2021-01-06 19:27:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:31,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293986611] [2021-01-06 19:27:31,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:31,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:31,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106647279] [2021-01-06 19:27:31,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:31,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:31,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:31,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:31,442 INFO L87 Difference]: Start difference. First operand 5610 states and 7915 transitions. Second operand 4 states. [2021-01-06 19:27:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:32,962 INFO L93 Difference]: Finished difference Result 21413 states and 30174 transitions. [2021-01-06 19:27:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:32,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2021-01-06 19:27:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:32,992 INFO L225 Difference]: With dead ends: 21413 [2021-01-06 19:27:32,992 INFO L226 Difference]: Without dead ends: 15857 [2021-01-06 19:27:33,004 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 [2021-01-06 19:27:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15857 states. [2021-01-06 19:27:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15857 to 15245. [2021-01-06 19:27:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15245 states. [2021-01-06 19:27:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15245 states to 15245 states and 21330 transitions. [2021-01-06 19:27:34,530 INFO L78 Accepts]: Start accepts. Automaton has 15245 states and 21330 transitions. Word has length 147 [2021-01-06 19:27:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:34,531 INFO L481 AbstractCegarLoop]: Abstraction has 15245 states and 21330 transitions. [2021-01-06 19:27:34,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 15245 states and 21330 transitions. [2021-01-06 19:27:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 19:27:34,534 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:34,535 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:27:34,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:27:34,535 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:34,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:34,536 INFO L82 PathProgramCache]: Analyzing trace with hash -80535961, now seen corresponding path program 1 times [2021-01-06 19:27:34,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:34,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149870940] [2021-01-06 19:27:34,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:34,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149870940] [2021-01-06 19:27:34,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:34,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:27:34,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054885717] [2021-01-06 19:27:34,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:27:34,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:27:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:34,592 INFO L87 Difference]: Start difference. First operand 15245 states and 21330 transitions. Second operand 5 states. [2021-01-06 19:27:36,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:36,532 INFO L93 Difference]: Finished difference Result 39502 states and 55569 transitions. [2021-01-06 19:27:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:27:36,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2021-01-06 19:27:36,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:36,559 INFO L225 Difference]: With dead ends: 39502 [2021-01-06 19:27:36,560 INFO L226 Difference]: Without dead ends: 24315 [2021-01-06 19:27:36,577 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 [2021-01-06 19:27:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24315 states. [2021-01-06 19:27:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24315 to 15434. [2021-01-06 19:27:38,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15434 states. [2021-01-06 19:27:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15434 states to 15434 states and 21408 transitions. [2021-01-06 19:27:38,474 INFO L78 Accepts]: Start accepts. Automaton has 15434 states and 21408 transitions. Word has length 151 [2021-01-06 19:27:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:38,474 INFO L481 AbstractCegarLoop]: Abstraction has 15434 states and 21408 transitions. [2021-01-06 19:27:38,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:27:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 15434 states and 21408 transitions. [2021-01-06 19:27:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 19:27:38,477 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:38,478 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:27:38,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:27:38,478 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1270849257, now seen corresponding path program 1 times [2021-01-06 19:27:38,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:38,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912245711] [2021-01-06 19:27:38,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:38,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912245711] [2021-01-06 19:27:38,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:38,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:27:38,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935784845] [2021-01-06 19:27:38,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:27:38,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:38,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:27:38,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:38,541 INFO L87 Difference]: Start difference. First operand 15434 states and 21408 transitions. Second operand 5 states. [2021-01-06 19:27:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:41,749 INFO L93 Difference]: Finished difference Result 55050 states and 77133 transitions. [2021-01-06 19:27:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:27:41,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2021-01-06 19:27:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:41,799 INFO L225 Difference]: With dead ends: 55050 [2021-01-06 19:27:41,799 INFO L226 Difference]: Without dead ends: 39681 [2021-01-06 19:27:41,814 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 [2021-01-06 19:27:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39681 states. [2021-01-06 19:27:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39681 to 15956. [2021-01-06 19:27:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15956 states. [2021-01-06 19:27:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15956 states to 15956 states and 21930 transitions. [2021-01-06 19:27:43,610 INFO L78 Accepts]: Start accepts. Automaton has 15956 states and 21930 transitions. Word has length 151 [2021-01-06 19:27:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:43,611 INFO L481 AbstractCegarLoop]: Abstraction has 15956 states and 21930 transitions. [2021-01-06 19:27:43,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:27:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 15956 states and 21930 transitions. [2021-01-06 19:27:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-01-06 19:27:43,614 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:43,614 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:27:43,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:27:43,615 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:43,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:43,615 INFO L82 PathProgramCache]: Analyzing trace with hash 500115691, now seen corresponding path program 1 times [2021-01-06 19:27:43,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:43,615 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096004081] [2021-01-06 19:27:43,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:43,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096004081] [2021-01-06 19:27:43,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:43,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:43,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826725136] [2021-01-06 19:27:43,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:43,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:43,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:43,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:43,683 INFO L87 Difference]: Start difference. First operand 15956 states and 21930 transitions. Second operand 4 states. [2021-01-06 19:27:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:48,125 INFO L93 Difference]: Finished difference Result 61037 states and 83841 transitions. [2021-01-06 19:27:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:48,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2021-01-06 19:27:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:48,165 INFO L225 Difference]: With dead ends: 61037 [2021-01-06 19:27:48,165 INFO L226 Difference]: Without dead ends: 45151 [2021-01-06 19:27:48,185 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 [2021-01-06 19:27:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45151 states. [2021-01-06 19:27:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45151 to 43811. [2021-01-06 19:27:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43811 states. [2021-01-06 19:27:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43811 states to 43811 states and 59795 transitions. [2021-01-06 19:27:52,260 INFO L78 Accepts]: Start accepts. Automaton has 43811 states and 59795 transitions. Word has length 151 [2021-01-06 19:27:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:52,260 INFO L481 AbstractCegarLoop]: Abstraction has 43811 states and 59795 transitions. [2021-01-06 19:27:52,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 43811 states and 59795 transitions. [2021-01-06 19:27:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 19:27:52,264 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:52,264 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:27:52,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:27:52,265 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:52,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:52,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1848351046, now seen corresponding path program 1 times [2021-01-06 19:27:52,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:52,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325713795] [2021-01-06 19:27:52,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:52,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325713795] [2021-01-06 19:27:52,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:52,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:27:52,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795870164] [2021-01-06 19:27:52,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:27:52,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:27:52,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:52,331 INFO L87 Difference]: Start difference. First operand 43811 states and 59795 transitions. Second operand 5 states. [2021-01-06 19:27:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:58,369 INFO L93 Difference]: Finished difference Result 110990 states and 152510 transitions. [2021-01-06 19:27:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:27:58,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2021-01-06 19:27:58,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:58,440 INFO L225 Difference]: With dead ends: 110990 [2021-01-06 19:27:58,440 INFO L226 Difference]: Without dead ends: 67253 [2021-01-06 19:27:58,477 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 [2021-01-06 19:27:58,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67253 states. [2021-01-06 19:28:02,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67253 to 44330. [2021-01-06 19:28:02,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44330 states. [2021-01-06 19:28:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44330 states to 44330 states and 60011 transitions. [2021-01-06 19:28:03,025 INFO L78 Accepts]: Start accepts. Automaton has 44330 states and 60011 transitions. Word has length 155 [2021-01-06 19:28:03,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:03,026 INFO L481 AbstractCegarLoop]: Abstraction has 44330 states and 60011 transitions. [2021-01-06 19:28:03,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:03,026 INFO L276 IsEmpty]: Start isEmpty. Operand 44330 states and 60011 transitions. [2021-01-06 19:28:03,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 19:28:03,031 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:03,031 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:28:03,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:28:03,032 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:03,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1262074824, now seen corresponding path program 1 times [2021-01-06 19:28:03,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:03,032 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883622550] [2021-01-06 19:28:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:28:03,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883622550] [2021-01-06 19:28:03,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:03,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:03,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050449068] [2021-01-06 19:28:03,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:03,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:03,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:03,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:03,092 INFO L87 Difference]: Start difference. First operand 44330 states and 60011 transitions. Second operand 5 states. [2021-01-06 19:28:12,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:12,865 INFO L93 Difference]: Finished difference Result 151026 states and 207034 transitions. [2021-01-06 19:28:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:12,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 155 [2021-01-06 19:28:12,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:12,989 INFO L225 Difference]: With dead ends: 151026 [2021-01-06 19:28:12,990 INFO L226 Difference]: Without dead ends: 106777 [2021-01-06 19:28:13,032 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 [2021-01-06 19:28:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106777 states. [2021-01-06 19:28:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106777 to 45758. [2021-01-06 19:28:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45758 states. [2021-01-06 19:28:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45758 states to 45758 states and 61439 transitions. [2021-01-06 19:28:18,294 INFO L78 Accepts]: Start accepts. Automaton has 45758 states and 61439 transitions. Word has length 155 [2021-01-06 19:28:18,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:18,295 INFO L481 AbstractCegarLoop]: Abstraction has 45758 states and 61439 transitions. [2021-01-06 19:28:18,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:18,295 INFO L276 IsEmpty]: Start isEmpty. Operand 45758 states and 61439 transitions. [2021-01-06 19:28:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 19:28:18,300 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:18,301 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:28:18,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:28:18,301 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:18,302 INFO L82 PathProgramCache]: Analyzing trace with hash 204236746, now seen corresponding path program 1 times [2021-01-06 19:28:18,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:18,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476941301] [2021-01-06 19:28:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:28:18,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476941301] [2021-01-06 19:28:18,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:18,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:18,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963997155] [2021-01-06 19:28:18,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:18,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:18,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:18,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:18,392 INFO L87 Difference]: Start difference. First operand 45758 states and 61439 transitions. Second operand 4 states. [2021-01-06 19:28:31,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:31,172 INFO L93 Difference]: Finished difference Result 174369 states and 234140 transitions. [2021-01-06 19:28:31,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:31,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2021-01-06 19:28:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:31,316 INFO L225 Difference]: With dead ends: 174369 [2021-01-06 19:28:31,316 INFO L226 Difference]: Without dead ends: 128697 [2021-01-06 19:28:31,357 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 [2021-01-06 19:28:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128697 states. [2021-01-06 19:28:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128697 to 125989. [2021-01-06 19:28:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125989 states. [2021-01-06 19:28:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125989 states to 125989 states and 168216 transitions. [2021-01-06 19:28:44,473 INFO L78 Accepts]: Start accepts. Automaton has 125989 states and 168216 transitions. Word has length 155 [2021-01-06 19:28:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:44,473 INFO L481 AbstractCegarLoop]: Abstraction has 125989 states and 168216 transitions. [2021-01-06 19:28:44,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 125989 states and 168216 transitions. [2021-01-06 19:28:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 19:28:44,481 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:44,481 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:28:44,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:28:44,481 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:44,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1887348773, now seen corresponding path program 1 times [2021-01-06 19:28:44,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:44,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638355512] [2021-01-06 19:28:44,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:28:44,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638355512] [2021-01-06 19:28:44,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:44,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:44,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314644291] [2021-01-06 19:28:44,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:44,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:44,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:44,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:44,549 INFO L87 Difference]: Start difference. First operand 125989 states and 168216 transitions. Second operand 5 states. [2021-01-06 19:28:44,836 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-01-06 19:29:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:03,886 INFO L93 Difference]: Finished difference Result 312350 states and 419973 transitions. [2021-01-06 19:29:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:03,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2021-01-06 19:29:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:04,128 INFO L225 Difference]: With dead ends: 312350 [2021-01-06 19:29:04,128 INFO L226 Difference]: Without dead ends: 186451 [2021-01-06 19:29:04,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:29:04,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186451 states. [2021-01-06 19:29:18,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186451 to 127414. [2021-01-06 19:29:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127414 states. [2021-01-06 19:29:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127414 states to 127414 states and 168814 transitions. [2021-01-06 19:29:18,930 INFO L78 Accepts]: Start accepts. Automaton has 127414 states and 168814 transitions. Word has length 159 [2021-01-06 19:29:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:18,930 INFO L481 AbstractCegarLoop]: Abstraction has 127414 states and 168814 transitions. [2021-01-06 19:29:18,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 127414 states and 168814 transitions. [2021-01-06 19:29:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-01-06 19:29:18,937 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:18,937 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:29:18,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:29:18,938 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:18,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2127588519, now seen corresponding path program 1 times [2021-01-06 19:29:18,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:18,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766846760] [2021-01-06 19:29:18,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:19,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:29:19,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766846760] [2021-01-06 19:29:19,008 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:19,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:19,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039910112] [2021-01-06 19:29:19,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:19,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:19,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:19,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:19,009 INFO L87 Difference]: Start difference. First operand 127414 states and 168814 transitions. Second operand 4 states. [2021-01-06 19:29:56,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:56,636 INFO L93 Difference]: Finished difference Result 483555 states and 641162 transitions. [2021-01-06 19:29:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:56,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2021-01-06 19:29:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:57,386 INFO L225 Difference]: With dead ends: 483555 [2021-01-06 19:29:57,386 INFO L226 Difference]: Without dead ends: 356233 [2021-01-06 19:29:57,578 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 [2021-01-06 19:29:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356233 states.