/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/transmitter.09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:36:54,794 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:36:54,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:36:54,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:36:54,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:36:54,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:36:54,839 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:36:54,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:36:54,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:36:54,845 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:36:54,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:36:54,848 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:36:54,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:36:54,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:36:54,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:36:54,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:36:54,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:36:54,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:36:54,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:36:54,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:36:54,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:36:54,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:36:54,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:36:54,904 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:36:54,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:36:54,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:36:54,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:36:54,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:36:54,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:36:54,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:36:54,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:36:54,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:36:54,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:36:54,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:36:54,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:36:54,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:36:54,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:36:54,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:36:54,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:36:54,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:36:54,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:36:54,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:36:54,995 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:36:54,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:36:54,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:36:54,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:36:55,000 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:36:55,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:36:55,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:36:55,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:36:55,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:36:55,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:36:55,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:36:55,002 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:36:55,003 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:36:55,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:36:55,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:36:55,004 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:36:55,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:36:55,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:36:55,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:36:55,005 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:36:55,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:36:55,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:36:55,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:36:55,006 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:36:55,006 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:36:55,006 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 09:36:55,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:36:55,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:36:55,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:36:55,497 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:36:55,498 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:36:55,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.09.cil.c [2020-12-23 09:36:55,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/596a161c0/5fd02ee6ac5245c491696e32bd66ced9/FLAGa3ca61355 [2020-12-23 09:36:56,369 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:36:56,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c [2020-12-23 09:36:56,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/596a161c0/5fd02ee6ac5245c491696e32bd66ced9/FLAGa3ca61355 [2020-12-23 09:36:56,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/596a161c0/5fd02ee6ac5245c491696e32bd66ced9 [2020-12-23 09:36:56,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:36:56,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:36:56,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:36:56,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:36:56,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:36:56,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:36:56" (1/1) ... [2020-12-23 09:36:56,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@189c96a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:56, skipping insertion in model container [2020-12-23 09:36:56,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:36:56" (1/1) ... [2020-12-23 09:36:56,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:36:56,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:36:56,823 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__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_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_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_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,] [2020-12-23 09:36:57,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:36:57,018 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:36:57,030 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__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_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_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_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,] [2020-12-23 09:36:57,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:36:57,145 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:36:57,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57 WrapperNode [2020-12-23 09:36:57,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:36:57,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:36:57,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:36:57,148 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:36:57,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (1/1) ... [2020-12-23 09:36:57,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (1/1) ... [2020-12-23 09:36:57,383 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:36:57,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:36:57,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:36:57,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:36:57,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (1/1) ... [2020-12-23 09:36:57,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (1/1) ... [2020-12-23 09:36:57,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (1/1) ... [2020-12-23 09:36:57,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (1/1) ... [2020-12-23 09:36:57,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (1/1) ... [2020-12-23 09:36:57,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (1/1) ... [2020-12-23 09:36:57,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (1/1) ... [2020-12-23 09:36:57,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:36:57,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:36:57,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:36:57,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:36:57,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:36:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:36:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:36:57,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:36:57,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:37:00,700 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:37:00,702 INFO L299 CfgBuilder]: Removed 353 assume(true) statements. [2020-12-23 09:37:00,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:37:00 BoogieIcfgContainer [2020-12-23 09:37:00,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:37:00,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:37:00,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:37:00,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:37:00,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:36:56" (1/3) ... [2020-12-23 09:37:00,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6acdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:37:00, skipping insertion in model container [2020-12-23 09:37:00,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:57" (2/3) ... [2020-12-23 09:37:00,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e6acdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:37:00, skipping insertion in model container [2020-12-23 09:37:00,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:37:00" (3/3) ... [2020-12-23 09:37:00,720 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.09.cil.c [2020-12-23 09:37:00,727 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:37:00,733 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:37:00,750 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:37:00,803 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:37:00,803 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:37:00,803 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:37:00,804 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:37:00,804 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:37:00,804 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:37:00,804 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:37:00,804 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:37:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states. [2020-12-23 09:37:00,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:00,869 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:00,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:00,871 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:00,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1244960034, now seen corresponding path program 1 times [2020-12-23 09:37:00,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:00,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803880603] [2020-12-23 09:37:00,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:01,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:01,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803880603] [2020-12-23 09:37:01,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:01,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:01,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21483934] [2020-12-23 09:37:01,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:01,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:01,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:01,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:01,237 INFO L87 Difference]: Start difference. First operand 1074 states. Second operand 3 states. [2020-12-23 09:37:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:01,396 INFO L93 Difference]: Finished difference Result 2143 states and 3269 transitions. [2020-12-23 09:37:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:01,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:37:01,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:01,440 INFO L225 Difference]: With dead ends: 2143 [2020-12-23 09:37:01,440 INFO L226 Difference]: Without dead ends: 1070 [2020-12-23 09:37:01,450 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2020-12-23 09:37:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2020-12-23 09:37:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2020-12-23 09:37:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1606 transitions. [2020-12-23 09:37:01,567 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1606 transitions. Word has length 133 [2020-12-23 09:37:01,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:01,568 INFO L481 AbstractCegarLoop]: Abstraction has 1070 states and 1606 transitions. [2020-12-23 09:37:01,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:01,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1606 transitions. [2020-12-23 09:37:01,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:01,572 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:01,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:01,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:37:01,573 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:01,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2101955296, now seen corresponding path program 1 times [2020-12-23 09:37:01,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:01,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952884664] [2020-12-23 09:37:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:01,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952884664] [2020-12-23 09:37:01,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:01,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:01,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147337999] [2020-12-23 09:37:01,740 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:01,740 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:01,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:01,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:01,742 INFO L87 Difference]: Start difference. First operand 1070 states and 1606 transitions. Second operand 3 states. [2020-12-23 09:37:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:01,795 INFO L93 Difference]: Finished difference Result 2127 states and 3190 transitions. [2020-12-23 09:37:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:01,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:37:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:01,824 INFO L225 Difference]: With dead ends: 2127 [2020-12-23 09:37:01,824 INFO L226 Difference]: Without dead ends: 1070 [2020-12-23 09:37:01,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:01,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2020-12-23 09:37:01,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2020-12-23 09:37:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2020-12-23 09:37:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1605 transitions. [2020-12-23 09:37:01,871 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1605 transitions. Word has length 133 [2020-12-23 09:37:01,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:01,874 INFO L481 AbstractCegarLoop]: Abstraction has 1070 states and 1605 transitions. [2020-12-23 09:37:01,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1605 transitions. [2020-12-23 09:37:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:01,880 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:01,881 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:01,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:37:01,881 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:01,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:01,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1704964894, now seen corresponding path program 1 times [2020-12-23 09:37:01,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:01,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132030506] [2020-12-23 09:37:01,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:02,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132030506] [2020-12-23 09:37:02,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:02,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:02,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728475164] [2020-12-23 09:37:02,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:02,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:02,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:02,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:02,013 INFO L87 Difference]: Start difference. First operand 1070 states and 1605 transitions. Second operand 3 states. [2020-12-23 09:37:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:02,217 INFO L93 Difference]: Finished difference Result 3004 states and 4493 transitions. [2020-12-23 09:37:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:02,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:37:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:02,229 INFO L225 Difference]: With dead ends: 3004 [2020-12-23 09:37:02,230 INFO L226 Difference]: Without dead ends: 1948 [2020-12-23 09:37:02,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:02,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2020-12-23 09:37:02,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1946. [2020-12-23 09:37:02,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:02,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2895 transitions. [2020-12-23 09:37:02,317 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2895 transitions. Word has length 133 [2020-12-23 09:37:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:02,317 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2895 transitions. [2020-12-23 09:37:02,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2895 transitions. [2020-12-23 09:37:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:02,320 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:02,320 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:02,320 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:37:02,320 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:02,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:02,322 INFO L82 PathProgramCache]: Analyzing trace with hash 612329692, now seen corresponding path program 1 times [2020-12-23 09:37:02,322 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:02,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226049951] [2020-12-23 09:37:02,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:02,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:02,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226049951] [2020-12-23 09:37:02,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:02,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:02,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409945075] [2020-12-23 09:37:02,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:02,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:02,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:02,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:02,504 INFO L87 Difference]: Start difference. First operand 1946 states and 2895 transitions. Second operand 4 states. [2020-12-23 09:37:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:02,924 INFO L93 Difference]: Finished difference Result 4754 states and 7058 transitions. [2020-12-23 09:37:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:02,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:02,945 INFO L225 Difference]: With dead ends: 4754 [2020-12-23 09:37:02,945 INFO L226 Difference]: Without dead ends: 2823 [2020-12-23 09:37:02,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2020-12-23 09:37:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1946. [2020-12-23 09:37:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2892 transitions. [2020-12-23 09:37:03,078 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2892 transitions. Word has length 133 [2020-12-23 09:37:03,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:03,078 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2892 transitions. [2020-12-23 09:37:03,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:03,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2892 transitions. [2020-12-23 09:37:03,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:03,081 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:03,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:03,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:37:03,082 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:03,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:03,082 INFO L82 PathProgramCache]: Analyzing trace with hash -669842594, now seen corresponding path program 1 times [2020-12-23 09:37:03,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:03,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677986244] [2020-12-23 09:37:03,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:03,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677986244] [2020-12-23 09:37:03,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:03,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:03,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564599081] [2020-12-23 09:37:03,245 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:03,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:03,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:03,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:03,248 INFO L87 Difference]: Start difference. First operand 1946 states and 2892 transitions. Second operand 4 states. [2020-12-23 09:37:03,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:03,600 INFO L93 Difference]: Finished difference Result 4752 states and 7048 transitions. [2020-12-23 09:37:03,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:03,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:03,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:03,615 INFO L225 Difference]: With dead ends: 4752 [2020-12-23 09:37:03,615 INFO L226 Difference]: Without dead ends: 2822 [2020-12-23 09:37:03,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2020-12-23 09:37:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 1946. [2020-12-23 09:37:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:03,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2889 transitions. [2020-12-23 09:37:03,743 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2889 transitions. Word has length 133 [2020-12-23 09:37:03,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:03,743 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2889 transitions. [2020-12-23 09:37:03,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:03,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2889 transitions. [2020-12-23 09:37:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:03,745 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:03,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:03,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:37:03,746 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1782648988, now seen corresponding path program 1 times [2020-12-23 09:37:03,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:03,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106285932] [2020-12-23 09:37:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:03,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:03,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:03,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106285932] [2020-12-23 09:37:03,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:03,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:03,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173911256] [2020-12-23 09:37:03,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:03,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:03,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:03,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:03,837 INFO L87 Difference]: Start difference. First operand 1946 states and 2889 transitions. Second operand 4 states. [2020-12-23 09:37:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:04,174 INFO L93 Difference]: Finished difference Result 4750 states and 7038 transitions. [2020-12-23 09:37:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:04,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:04,189 INFO L225 Difference]: With dead ends: 4750 [2020-12-23 09:37:04,189 INFO L226 Difference]: Without dead ends: 2821 [2020-12-23 09:37:04,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2020-12-23 09:37:04,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 1946. [2020-12-23 09:37:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:04,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2886 transitions. [2020-12-23 09:37:04,310 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2886 transitions. Word has length 133 [2020-12-23 09:37:04,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:04,311 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2886 transitions. [2020-12-23 09:37:04,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:04,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2886 transitions. [2020-12-23 09:37:04,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:04,313 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:04,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:04,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:37:04,313 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash 60646302, now seen corresponding path program 1 times [2020-12-23 09:37:04,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:04,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943046647] [2020-12-23 09:37:04,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:04,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943046647] [2020-12-23 09:37:04,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:04,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:04,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322884179] [2020-12-23 09:37:04,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:04,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:04,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:04,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:04,392 INFO L87 Difference]: Start difference. First operand 1946 states and 2886 transitions. Second operand 3 states. [2020-12-23 09:37:04,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:04,514 INFO L93 Difference]: Finished difference Result 3874 states and 5745 transitions. [2020-12-23 09:37:04,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:04,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:37:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:04,525 INFO L225 Difference]: With dead ends: 3874 [2020-12-23 09:37:04,525 INFO L226 Difference]: Without dead ends: 1946 [2020-12-23 09:37:04,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-12-23 09:37:04,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2020-12-23 09:37:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2878 transitions. [2020-12-23 09:37:04,661 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2878 transitions. Word has length 133 [2020-12-23 09:37:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:04,661 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2878 transitions. [2020-12-23 09:37:04,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2878 transitions. [2020-12-23 09:37:04,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:04,663 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:04,663 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:04,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:37:04,664 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:04,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash 387534686, now seen corresponding path program 1 times [2020-12-23 09:37:04,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:04,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188478344] [2020-12-23 09:37:04,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:04,726 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188478344] [2020-12-23 09:37:04,726 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:04,726 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:04,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976144423] [2020-12-23 09:37:04,727 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:04,727 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:04,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:04,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:04,728 INFO L87 Difference]: Start difference. First operand 1946 states and 2878 transitions. Second operand 3 states. [2020-12-23 09:37:04,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:04,852 INFO L93 Difference]: Finished difference Result 3873 states and 5728 transitions. [2020-12-23 09:37:04,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:04,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:37:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:04,864 INFO L225 Difference]: With dead ends: 3873 [2020-12-23 09:37:04,865 INFO L226 Difference]: Without dead ends: 1946 [2020-12-23 09:37:04,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-12-23 09:37:04,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2020-12-23 09:37:04,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:04,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2870 transitions. [2020-12-23 09:37:04,982 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2870 transitions. Word has length 133 [2020-12-23 09:37:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:04,983 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2870 transitions. [2020-12-23 09:37:04,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:04,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2870 transitions. [2020-12-23 09:37:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:04,985 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:04,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:04,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:37:04,985 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:04,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:04,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1922100126, now seen corresponding path program 1 times [2020-12-23 09:37:04,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:04,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592614395] [2020-12-23 09:37:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:05,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592614395] [2020-12-23 09:37:05,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:05,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:05,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091819083] [2020-12-23 09:37:05,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:05,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:05,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:05,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:05,092 INFO L87 Difference]: Start difference. First operand 1946 states and 2870 transitions. Second operand 4 states. [2020-12-23 09:37:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:05,438 INFO L93 Difference]: Finished difference Result 4744 states and 6986 transitions. [2020-12-23 09:37:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:05,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:05,454 INFO L225 Difference]: With dead ends: 4744 [2020-12-23 09:37:05,454 INFO L226 Difference]: Without dead ends: 2818 [2020-12-23 09:37:05,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:05,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2020-12-23 09:37:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 1946. [2020-12-23 09:37:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2867 transitions. [2020-12-23 09:37:05,575 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2867 transitions. Word has length 133 [2020-12-23 09:37:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:05,575 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2867 transitions. [2020-12-23 09:37:05,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2867 transitions. [2020-12-23 09:37:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:05,577 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:05,577 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:05,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:37:05,578 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:05,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash -370980900, now seen corresponding path program 1 times [2020-12-23 09:37:05,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:05,579 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271767762] [2020-12-23 09:37:05,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:05,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:05,630 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271767762] [2020-12-23 09:37:05,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:05,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:05,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336690146] [2020-12-23 09:37:05,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:05,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:05,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:05,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:05,633 INFO L87 Difference]: Start difference. First operand 1946 states and 2867 transitions. Second operand 3 states. [2020-12-23 09:37:05,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:05,781 INFO L93 Difference]: Finished difference Result 3870 states and 5702 transitions. [2020-12-23 09:37:05,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:05,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:37:05,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:05,801 INFO L225 Difference]: With dead ends: 3870 [2020-12-23 09:37:05,801 INFO L226 Difference]: Without dead ends: 1946 [2020-12-23 09:37:05,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-12-23 09:37:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2020-12-23 09:37:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2859 transitions. [2020-12-23 09:37:05,965 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2859 transitions. Word has length 133 [2020-12-23 09:37:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:05,965 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2859 transitions. [2020-12-23 09:37:05,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2859 transitions. [2020-12-23 09:37:05,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:05,967 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:05,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:05,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:37:05,968 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:05,969 INFO L82 PathProgramCache]: Analyzing trace with hash 100375450, now seen corresponding path program 1 times [2020-12-23 09:37:05,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:05,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586584681] [2020-12-23 09:37:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:06,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586584681] [2020-12-23 09:37:06,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:06,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:06,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534866643] [2020-12-23 09:37:06,062 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:06,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:06,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:06,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:06,066 INFO L87 Difference]: Start difference. First operand 1946 states and 2859 transitions. Second operand 3 states. [2020-12-23 09:37:06,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:06,247 INFO L93 Difference]: Finished difference Result 3869 states and 5685 transitions. [2020-12-23 09:37:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:06,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:37:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:06,261 INFO L225 Difference]: With dead ends: 3869 [2020-12-23 09:37:06,261 INFO L226 Difference]: Without dead ends: 1946 [2020-12-23 09:37:06,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-12-23 09:37:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2020-12-23 09:37:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2851 transitions. [2020-12-23 09:37:06,443 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2851 transitions. Word has length 133 [2020-12-23 09:37:06,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:06,443 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2851 transitions. [2020-12-23 09:37:06,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2851 transitions. [2020-12-23 09:37:06,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:06,446 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:06,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:06,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:37:06,446 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1272227878, now seen corresponding path program 1 times [2020-12-23 09:37:06,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:06,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312674530] [2020-12-23 09:37:06,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:06,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312674530] [2020-12-23 09:37:06,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:06,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:06,513 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803806336] [2020-12-23 09:37:06,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:06,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:06,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:06,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:06,515 INFO L87 Difference]: Start difference. First operand 1946 states and 2851 transitions. Second operand 4 states. [2020-12-23 09:37:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:06,969 INFO L93 Difference]: Finished difference Result 4666 states and 6831 transitions. [2020-12-23 09:37:06,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:06,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:06,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:06,998 INFO L225 Difference]: With dead ends: 4666 [2020-12-23 09:37:06,998 INFO L226 Difference]: Without dead ends: 2744 [2020-12-23 09:37:07,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:07,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2020-12-23 09:37:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1946. [2020-12-23 09:37:07,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2848 transitions. [2020-12-23 09:37:07,157 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2848 transitions. Word has length 133 [2020-12-23 09:37:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:07,157 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2848 transitions. [2020-12-23 09:37:07,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:07,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2848 transitions. [2020-12-23 09:37:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:07,159 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:07,160 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:07,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:37:07,160 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:07,161 INFO L82 PathProgramCache]: Analyzing trace with hash 891388696, now seen corresponding path program 1 times [2020-12-23 09:37:07,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:07,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672342799] [2020-12-23 09:37:07,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:07,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:07,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672342799] [2020-12-23 09:37:07,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:07,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:07,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961569667] [2020-12-23 09:37:07,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:07,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:07,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:07,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:07,213 INFO L87 Difference]: Start difference. First operand 1946 states and 2848 transitions. Second operand 3 states. [2020-12-23 09:37:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:07,402 INFO L93 Difference]: Finished difference Result 3867 states and 5661 transitions. [2020-12-23 09:37:07,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:07,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:37:07,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:07,411 INFO L225 Difference]: With dead ends: 3867 [2020-12-23 09:37:07,411 INFO L226 Difference]: Without dead ends: 1946 [2020-12-23 09:37:07,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:07,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-12-23 09:37:07,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2020-12-23 09:37:07,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2820 transitions. [2020-12-23 09:37:07,559 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2820 transitions. Word has length 133 [2020-12-23 09:37:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:07,559 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2820 transitions. [2020-12-23 09:37:07,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2820 transitions. [2020-12-23 09:37:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:07,562 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:07,562 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:07,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:37:07,562 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:07,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:07,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1077630711, now seen corresponding path program 1 times [2020-12-23 09:37:07,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:07,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254552321] [2020-12-23 09:37:07,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:07,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254552321] [2020-12-23 09:37:07,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:07,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:07,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176554634] [2020-12-23 09:37:07,668 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:07,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:07,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:07,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:07,669 INFO L87 Difference]: Start difference. First operand 1946 states and 2820 transitions. Second operand 4 states. [2020-12-23 09:37:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:08,149 INFO L93 Difference]: Finished difference Result 4662 states and 6752 transitions. [2020-12-23 09:37:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:08,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:08,157 INFO L225 Difference]: With dead ends: 4662 [2020-12-23 09:37:08,158 INFO L226 Difference]: Without dead ends: 2742 [2020-12-23 09:37:08,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2020-12-23 09:37:08,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 1946. [2020-12-23 09:37:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:08,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2817 transitions. [2020-12-23 09:37:08,288 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2817 transitions. Word has length 133 [2020-12-23 09:37:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:08,290 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2817 transitions. [2020-12-23 09:37:08,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2817 transitions. [2020-12-23 09:37:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:08,292 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:08,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:08,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:37:08,293 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:08,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:08,293 INFO L82 PathProgramCache]: Analyzing trace with hash -895534667, now seen corresponding path program 1 times [2020-12-23 09:37:08,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:08,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436872451] [2020-12-23 09:37:08,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:08,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436872451] [2020-12-23 09:37:08,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:08,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:08,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330632143] [2020-12-23 09:37:08,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:08,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:08,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:08,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:08,353 INFO L87 Difference]: Start difference. First operand 1946 states and 2817 transitions. Second operand 3 states. [2020-12-23 09:37:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:08,566 INFO L93 Difference]: Finished difference Result 3865 states and 5597 transitions. [2020-12-23 09:37:08,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:08,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:37:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:08,571 INFO L225 Difference]: With dead ends: 3865 [2020-12-23 09:37:08,571 INFO L226 Difference]: Without dead ends: 1946 [2020-12-23 09:37:08,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-12-23 09:37:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2020-12-23 09:37:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2789 transitions. [2020-12-23 09:37:08,705 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2789 transitions. Word has length 133 [2020-12-23 09:37:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:08,705 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2789 transitions. [2020-12-23 09:37:08,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2789 transitions. [2020-12-23 09:37:08,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:08,707 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:08,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:08,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:37:08,709 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:08,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:08,709 INFO L82 PathProgramCache]: Analyzing trace with hash 827216916, now seen corresponding path program 1 times [2020-12-23 09:37:08,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:08,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66405610] [2020-12-23 09:37:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:08,789 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66405610] [2020-12-23 09:37:08,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:08,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:08,792 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646322281] [2020-12-23 09:37:08,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:08,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:08,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:08,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:08,794 INFO L87 Difference]: Start difference. First operand 1946 states and 2789 transitions. Second operand 4 states. [2020-12-23 09:37:09,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:09,292 INFO L93 Difference]: Finished difference Result 4658 states and 6673 transitions. [2020-12-23 09:37:09,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:09,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:09,298 INFO L225 Difference]: With dead ends: 4658 [2020-12-23 09:37:09,298 INFO L226 Difference]: Without dead ends: 2740 [2020-12-23 09:37:09,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2020-12-23 09:37:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 1946. [2020-12-23 09:37:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:09,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2786 transitions. [2020-12-23 09:37:09,447 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2786 transitions. Word has length 133 [2020-12-23 09:37:09,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:09,447 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2786 transitions. [2020-12-23 09:37:09,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:09,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2786 transitions. [2020-12-23 09:37:09,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:09,449 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:09,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:09,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:37:09,450 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:09,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:09,450 INFO L82 PathProgramCache]: Analyzing trace with hash 203935314, now seen corresponding path program 1 times [2020-12-23 09:37:09,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:09,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432054705] [2020-12-23 09:37:09,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:09,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432054705] [2020-12-23 09:37:09,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:09,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:09,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332551480] [2020-12-23 09:37:09,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:09,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:09,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:09,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:09,512 INFO L87 Difference]: Start difference. First operand 1946 states and 2786 transitions. Second operand 4 states. [2020-12-23 09:37:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:10,000 INFO L93 Difference]: Finished difference Result 4654 states and 6659 transitions. [2020-12-23 09:37:10,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:10,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:10,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:10,007 INFO L225 Difference]: With dead ends: 4654 [2020-12-23 09:37:10,007 INFO L226 Difference]: Without dead ends: 2738 [2020-12-23 09:37:10,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2020-12-23 09:37:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 1946. [2020-12-23 09:37:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:10,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2783 transitions. [2020-12-23 09:37:10,147 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2783 transitions. Word has length 133 [2020-12-23 09:37:10,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:10,147 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2783 transitions. [2020-12-23 09:37:10,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2783 transitions. [2020-12-23 09:37:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:10,149 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:10,149 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:10,149 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:37:10,150 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:10,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:10,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1593229328, now seen corresponding path program 1 times [2020-12-23 09:37:10,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:10,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024233874] [2020-12-23 09:37:10,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:10,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024233874] [2020-12-23 09:37:10,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:10,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:10,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392666232] [2020-12-23 09:37:10,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:10,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:10,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:10,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:10,211 INFO L87 Difference]: Start difference. First operand 1946 states and 2783 transitions. Second operand 4 states. [2020-12-23 09:37:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:10,682 INFO L93 Difference]: Finished difference Result 4652 states and 6649 transitions. [2020-12-23 09:37:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:10,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:10,689 INFO L225 Difference]: With dead ends: 4652 [2020-12-23 09:37:10,689 INFO L226 Difference]: Without dead ends: 2737 [2020-12-23 09:37:10,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2020-12-23 09:37:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 1946. [2020-12-23 09:37:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2780 transitions. [2020-12-23 09:37:10,861 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2780 transitions. Word has length 133 [2020-12-23 09:37:10,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:10,861 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2780 transitions. [2020-12-23 09:37:10,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:10,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2780 transitions. [2020-12-23 09:37:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:10,863 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:10,863 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:10,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:37:10,864 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:10,864 INFO L82 PathProgramCache]: Analyzing trace with hash -440164718, now seen corresponding path program 1 times [2020-12-23 09:37:10,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:10,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8330933] [2020-12-23 09:37:10,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:10,940 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8330933] [2020-12-23 09:37:10,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:10,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:10,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334194200] [2020-12-23 09:37:10,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:10,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:10,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:10,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:10,945 INFO L87 Difference]: Start difference. First operand 1946 states and 2780 transitions. Second operand 4 states. [2020-12-23 09:37:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:11,383 INFO L93 Difference]: Finished difference Result 4650 states and 6639 transitions. [2020-12-23 09:37:11,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:11,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:11,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:11,390 INFO L225 Difference]: With dead ends: 4650 [2020-12-23 09:37:11,391 INFO L226 Difference]: Without dead ends: 2736 [2020-12-23 09:37:11,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:11,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2020-12-23 09:37:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1946. [2020-12-23 09:37:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2020-12-23 09:37:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2777 transitions. [2020-12-23 09:37:11,561 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2777 transitions. Word has length 133 [2020-12-23 09:37:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:11,561 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2777 transitions. [2020-12-23 09:37:11,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:11,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2777 transitions. [2020-12-23 09:37:11,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:11,564 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:11,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:11,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:37:11,564 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:11,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:11,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1988093904, now seen corresponding path program 1 times [2020-12-23 09:37:11,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:11,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571304794] [2020-12-23 09:37:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:11,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571304794] [2020-12-23 09:37:11,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:11,629 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:11,629 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868721948] [2020-12-23 09:37:11,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:11,630 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:11,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:11,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:11,630 INFO L87 Difference]: Start difference. First operand 1946 states and 2777 transitions. Second operand 5 states. [2020-12-23 09:37:12,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:12,300 INFO L93 Difference]: Finished difference Result 6004 states and 8619 transitions. [2020-12-23 09:37:12,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:12,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-12-23 09:37:12,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:12,310 INFO L225 Difference]: With dead ends: 6004 [2020-12-23 09:37:12,310 INFO L226 Difference]: Without dead ends: 4097 [2020-12-23 09:37:12,315 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:37:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2020-12-23 09:37:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 1979. [2020-12-23 09:37:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2020-12-23 09:37:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 2799 transitions. [2020-12-23 09:37:12,511 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 2799 transitions. Word has length 133 [2020-12-23 09:37:12,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:12,512 INFO L481 AbstractCegarLoop]: Abstraction has 1979 states and 2799 transitions. [2020-12-23 09:37:12,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2799 transitions. [2020-12-23 09:37:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:12,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:12,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:12,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:37:12,514 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:12,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:12,515 INFO L82 PathProgramCache]: Analyzing trace with hash 931362702, now seen corresponding path program 1 times [2020-12-23 09:37:12,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:12,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461257848] [2020-12-23 09:37:12,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:12,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461257848] [2020-12-23 09:37:12,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:12,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:12,571 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251443861] [2020-12-23 09:37:12,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:12,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:12,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:12,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:12,572 INFO L87 Difference]: Start difference. First operand 1979 states and 2799 transitions. Second operand 4 states. [2020-12-23 09:37:13,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:13,338 INFO L93 Difference]: Finished difference Result 7383 states and 10433 transitions. [2020-12-23 09:37:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:13,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:13,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:13,351 INFO L225 Difference]: With dead ends: 7383 [2020-12-23 09:37:13,351 INFO L226 Difference]: Without dead ends: 5438 [2020-12-23 09:37:13,356 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:13,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5438 states. [2020-12-23 09:37:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5438 to 5162. [2020-12-23 09:37:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5162 states. [2020-12-23 09:37:13,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5162 states to 5162 states and 7244 transitions. [2020-12-23 09:37:13,847 INFO L78 Accepts]: Start accepts. Automaton has 5162 states and 7244 transitions. Word has length 133 [2020-12-23 09:37:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:13,847 INFO L481 AbstractCegarLoop]: Abstraction has 5162 states and 7244 transitions. [2020-12-23 09:37:13,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 5162 states and 7244 transitions. [2020-12-23 09:37:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:13,856 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:13,856 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:13,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:37:13,859 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:13,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:13,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1204358125, now seen corresponding path program 1 times [2020-12-23 09:37:13,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:13,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64019872] [2020-12-23 09:37:13,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:13,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64019872] [2020-12-23 09:37:13,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:13,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:13,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533951407] [2020-12-23 09:37:13,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:13,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:13,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:13,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:13,960 INFO L87 Difference]: Start difference. First operand 5162 states and 7244 transitions. Second operand 5 states. [2020-12-23 09:37:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:15,111 INFO L93 Difference]: Finished difference Result 13627 states and 19176 transitions. [2020-12-23 09:37:15,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:15,113 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-12-23 09:37:15,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:15,130 INFO L225 Difference]: With dead ends: 13627 [2020-12-23 09:37:15,130 INFO L226 Difference]: Without dead ends: 8509 [2020-12-23 09:37:15,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:37:15,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8509 states. [2020-12-23 09:37:15,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8509 to 5225. [2020-12-23 09:37:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5225 states. [2020-12-23 09:37:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5225 states to 5225 states and 7270 transitions. [2020-12-23 09:37:15,581 INFO L78 Accepts]: Start accepts. Automaton has 5225 states and 7270 transitions. Word has length 133 [2020-12-23 09:37:15,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:15,582 INFO L481 AbstractCegarLoop]: Abstraction has 5225 states and 7270 transitions. [2020-12-23 09:37:15,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:15,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5225 states and 7270 transitions. [2020-12-23 09:37:15,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:15,584 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:15,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:15,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:37:15,584 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:15,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:15,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1213545941, now seen corresponding path program 1 times [2020-12-23 09:37:15,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:15,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867617519] [2020-12-23 09:37:15,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:15,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867617519] [2020-12-23 09:37:15,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:15,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:15,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507943264] [2020-12-23 09:37:15,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:15,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:15,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:15,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:15,645 INFO L87 Difference]: Start difference. First operand 5225 states and 7270 transitions. Second operand 5 states. [2020-12-23 09:37:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:16,386 INFO L93 Difference]: Finished difference Result 11497 states and 15969 transitions. [2020-12-23 09:37:16,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:16,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-12-23 09:37:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:16,400 INFO L225 Difference]: With dead ends: 11497 [2020-12-23 09:37:16,401 INFO L226 Difference]: Without dead ends: 6323 [2020-12-23 09:37:16,410 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:37:16,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6323 states. [2020-12-23 09:37:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6323 to 5231. [2020-12-23 09:37:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5231 states. [2020-12-23 09:37:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 7220 transitions. [2020-12-23 09:37:16,984 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 7220 transitions. Word has length 133 [2020-12-23 09:37:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:16,985 INFO L481 AbstractCegarLoop]: Abstraction has 5231 states and 7220 transitions. [2020-12-23 09:37:16,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 7220 transitions. [2020-12-23 09:37:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:16,986 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:16,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:16,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:37:16,987 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:16,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1202290409, now seen corresponding path program 1 times [2020-12-23 09:37:16,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:16,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421529446] [2020-12-23 09:37:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:17,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421529446] [2020-12-23 09:37:17,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:17,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:17,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458124391] [2020-12-23 09:37:17,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:17,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:17,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:17,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:17,061 INFO L87 Difference]: Start difference. First operand 5231 states and 7220 transitions. Second operand 5 states. [2020-12-23 09:37:18,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:18,049 INFO L93 Difference]: Finished difference Result 13682 states and 18810 transitions. [2020-12-23 09:37:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:18,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-12-23 09:37:18,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:18,064 INFO L225 Difference]: With dead ends: 13682 [2020-12-23 09:37:18,064 INFO L226 Difference]: Without dead ends: 8516 [2020-12-23 09:37:18,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:37:18,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8516 states. [2020-12-23 09:37:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8516 to 5249. [2020-12-23 09:37:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5249 states. [2020-12-23 09:37:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5249 states to 5249 states and 7186 transitions. [2020-12-23 09:37:18,488 INFO L78 Accepts]: Start accepts. Automaton has 5249 states and 7186 transitions. Word has length 133 [2020-12-23 09:37:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:18,488 INFO L481 AbstractCegarLoop]: Abstraction has 5249 states and 7186 transitions. [2020-12-23 09:37:18,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 5249 states and 7186 transitions. [2020-12-23 09:37:18,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:18,489 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:18,489 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:18,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:37:18,490 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:18,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:18,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1279191207, now seen corresponding path program 1 times [2020-12-23 09:37:18,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:18,490 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368456425] [2020-12-23 09:37:18,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:18,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368456425] [2020-12-23 09:37:18,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:18,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:18,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43652668] [2020-12-23 09:37:18,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:18,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:18,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:18,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:18,563 INFO L87 Difference]: Start difference. First operand 5249 states and 7186 transitions. Second operand 5 states. [2020-12-23 09:37:19,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:19,869 INFO L93 Difference]: Finished difference Result 18176 states and 25140 transitions. [2020-12-23 09:37:19,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:19,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-12-23 09:37:19,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:19,881 INFO L225 Difference]: With dead ends: 18176 [2020-12-23 09:37:19,881 INFO L226 Difference]: Without dead ends: 12999 [2020-12-23 09:37:19,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:37:19,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12999 states. [2020-12-23 09:37:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12999 to 5423. [2020-12-23 09:37:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5423 states. [2020-12-23 09:37:20,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5423 states to 5423 states and 7360 transitions. [2020-12-23 09:37:20,692 INFO L78 Accepts]: Start accepts. Automaton has 5423 states and 7360 transitions. Word has length 133 [2020-12-23 09:37:20,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:20,692 INFO L481 AbstractCegarLoop]: Abstraction has 5423 states and 7360 transitions. [2020-12-23 09:37:20,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 5423 states and 7360 transitions. [2020-12-23 09:37:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:20,694 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:20,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:20,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:37:20,694 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:20,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:20,695 INFO L82 PathProgramCache]: Analyzing trace with hash 547223781, now seen corresponding path program 1 times [2020-12-23 09:37:20,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:20,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977806532] [2020-12-23 09:37:20,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:20,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977806532] [2020-12-23 09:37:20,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:20,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:37:20,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613097686] [2020-12-23 09:37:20,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:37:20,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:20,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:37:20,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:20,759 INFO L87 Difference]: Start difference. First operand 5423 states and 7360 transitions. Second operand 3 states. [2020-12-23 09:37:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:21,825 INFO L93 Difference]: Finished difference Result 15568 states and 21132 transitions. [2020-12-23 09:37:21,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:37:21,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2020-12-23 09:37:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:21,840 INFO L225 Difference]: With dead ends: 15568 [2020-12-23 09:37:21,840 INFO L226 Difference]: Without dead ends: 10222 [2020-12-23 09:37:21,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:37:21,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10222 states. [2020-12-23 09:37:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10222 to 10208. [2020-12-23 09:37:22,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10208 states. [2020-12-23 09:37:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10208 states to 10208 states and 13797 transitions. [2020-12-23 09:37:22,975 INFO L78 Accepts]: Start accepts. Automaton has 10208 states and 13797 transitions. Word has length 133 [2020-12-23 09:37:22,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:22,976 INFO L481 AbstractCegarLoop]: Abstraction has 10208 states and 13797 transitions. [2020-12-23 09:37:22,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:37:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 10208 states and 13797 transitions. [2020-12-23 09:37:22,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:22,980 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:22,980 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:22,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:37:22,980 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:22,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:22,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1252142468, now seen corresponding path program 1 times [2020-12-23 09:37:22,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:22,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617088999] [2020-12-23 09:37:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:22,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:23,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:23,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617088999] [2020-12-23 09:37:23,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:23,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:23,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861494532] [2020-12-23 09:37:23,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:23,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:23,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:23,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:23,050 INFO L87 Difference]: Start difference. First operand 10208 states and 13797 transitions. Second operand 5 states. [2020-12-23 09:37:24,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:24,813 INFO L93 Difference]: Finished difference Result 27760 states and 37807 transitions. [2020-12-23 09:37:24,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:24,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-12-23 09:37:24,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:24,833 INFO L225 Difference]: With dead ends: 27760 [2020-12-23 09:37:24,833 INFO L226 Difference]: Without dead ends: 17633 [2020-12-23 09:37:24,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:37:24,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17633 states. [2020-12-23 09:37:25,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17633 to 10379. [2020-12-23 09:37:25,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10379 states. [2020-12-23 09:37:25,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10379 states to 10379 states and 13916 transitions. [2020-12-23 09:37:25,779 INFO L78 Accepts]: Start accepts. Automaton has 10379 states and 13916 transitions. Word has length 133 [2020-12-23 09:37:25,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:25,780 INFO L481 AbstractCegarLoop]: Abstraction has 10379 states and 13916 transitions. [2020-12-23 09:37:25,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:25,780 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 13916 transitions. [2020-12-23 09:37:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:25,781 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:25,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:25,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:37:25,781 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:25,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:25,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1453966402, now seen corresponding path program 1 times [2020-12-23 09:37:25,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:25,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940723523] [2020-12-23 09:37:25,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:25,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940723523] [2020-12-23 09:37:25,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:25,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:25,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078708947] [2020-12-23 09:37:25,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:25,864 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:25,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:25,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:25,865 INFO L87 Difference]: Start difference. First operand 10379 states and 13916 transitions. Second operand 5 states. [2020-12-23 09:37:28,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:28,352 INFO L93 Difference]: Finished difference Result 34355 states and 46558 transitions. [2020-12-23 09:37:28,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:28,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-12-23 09:37:28,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:28,378 INFO L225 Difference]: With dead ends: 34355 [2020-12-23 09:37:28,378 INFO L226 Difference]: Without dead ends: 24064 [2020-12-23 09:37:28,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:37:28,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24064 states. [2020-12-23 09:37:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24064 to 10706. [2020-12-23 09:37:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10706 states. [2020-12-23 09:37:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10706 states to 10706 states and 14243 transitions. [2020-12-23 09:37:29,431 INFO L78 Accepts]: Start accepts. Automaton has 10706 states and 14243 transitions. Word has length 133 [2020-12-23 09:37:29,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:29,431 INFO L481 AbstractCegarLoop]: Abstraction has 10706 states and 14243 transitions. [2020-12-23 09:37:29,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 10706 states and 14243 transitions. [2020-12-23 09:37:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:29,432 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:29,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:29,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:37:29,432 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:29,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:29,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1964981888, now seen corresponding path program 1 times [2020-12-23 09:37:29,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:29,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241822902] [2020-12-23 09:37:29,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:29,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241822902] [2020-12-23 09:37:29,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:29,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:29,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651419680] [2020-12-23 09:37:29,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:29,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:29,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:29,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:29,508 INFO L87 Difference]: Start difference. First operand 10706 states and 14243 transitions. Second operand 4 states. [2020-12-23 09:37:32,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:32,617 INFO L93 Difference]: Finished difference Result 40362 states and 53693 transitions. [2020-12-23 09:37:32,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:32,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:32,655 INFO L225 Difference]: With dead ends: 40362 [2020-12-23 09:37:32,655 INFO L226 Difference]: Without dead ends: 29749 [2020-12-23 09:37:32,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29749 states. [2020-12-23 09:37:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29749 to 28873. [2020-12-23 09:37:35,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28873 states. [2020-12-23 09:37:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 38186 transitions. [2020-12-23 09:37:35,413 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 38186 transitions. Word has length 133 [2020-12-23 09:37:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:35,413 INFO L481 AbstractCegarLoop]: Abstraction has 28873 states and 38186 transitions. [2020-12-23 09:37:35,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:37:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 38186 transitions. [2020-12-23 09:37:35,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:35,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:35,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:35,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:37:35,415 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:35,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1628417183, now seen corresponding path program 1 times [2020-12-23 09:37:35,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:35,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062148364] [2020-12-23 09:37:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:35,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062148364] [2020-12-23 09:37:35,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:35,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:37:35,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734139783] [2020-12-23 09:37:35,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:37:35,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:35,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:37:35,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:35,477 INFO L87 Difference]: Start difference. First operand 28873 states and 38186 transitions. Second operand 5 states. [2020-12-23 09:37:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:39,946 INFO L93 Difference]: Finished difference Result 70833 states and 94226 transitions. [2020-12-23 09:37:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:37:39,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2020-12-23 09:37:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:40,000 INFO L225 Difference]: With dead ends: 70833 [2020-12-23 09:37:40,001 INFO L226 Difference]: Without dead ends: 42057 [2020-12-23 09:37:40,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:37:40,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42057 states. [2020-12-23 09:37:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42057 to 29197. [2020-12-23 09:37:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29197 states. [2020-12-23 09:37:43,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29197 states to 29197 states and 38325 transitions. [2020-12-23 09:37:43,398 INFO L78 Accepts]: Start accepts. Automaton has 29197 states and 38325 transitions. Word has length 133 [2020-12-23 09:37:43,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:37:43,398 INFO L481 AbstractCegarLoop]: Abstraction has 29197 states and 38325 transitions. [2020-12-23 09:37:43,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:37:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 29197 states and 38325 transitions. [2020-12-23 09:37:43,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-12-23 09:37:43,400 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:37:43,400 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:37:43,400 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 09:37:43,400 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:37:43,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:37:43,401 INFO L82 PathProgramCache]: Analyzing trace with hash -727388067, now seen corresponding path program 1 times [2020-12-23 09:37:43,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:37:43,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45754712] [2020-12-23 09:37:43,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:37:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:37:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:37:43,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45754712] [2020-12-23 09:37:43,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:37:43,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:37:43,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361136897] [2020-12-23 09:37:43,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:37:43,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:37:43,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:37:43,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:37:43,608 INFO L87 Difference]: Start difference. First operand 29197 states and 38325 transitions. Second operand 4 states. [2020-12-23 09:37:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:37:52,326 INFO L93 Difference]: Finished difference Result 115410 states and 151093 transitions. [2020-12-23 09:37:52,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:37:52,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2020-12-23 09:37:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:37:52,432 INFO L225 Difference]: With dead ends: 115410 [2020-12-23 09:37:52,432 INFO L226 Difference]: Without dead ends: 86312 [2020-12-23 09:37:52,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:37:52,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86312 states. [2020-12-23 09:38:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86312 to 84800. [2020-12-23 09:38:01,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84800 states. [2020-12-23 09:38:01,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84800 states to 84800 states and 110236 transitions. [2020-12-23 09:38:01,647 INFO L78 Accepts]: Start accepts. Automaton has 84800 states and 110236 transitions. Word has length 133 [2020-12-23 09:38:01,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:01,647 INFO L481 AbstractCegarLoop]: Abstraction has 84800 states and 110236 transitions. [2020-12-23 09:38:01,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:01,647 INFO L276 IsEmpty]: Start isEmpty. Operand 84800 states and 110236 transitions. [2020-12-23 09:38:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-23 09:38:01,654 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:01,654 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:38:01,654 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 09:38:01,655 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:01,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:01,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1994402793, now seen corresponding path program 1 times [2020-12-23 09:38:01,655 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:01,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466612591] [2020-12-23 09:38:01,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 09:38:01,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466612591] [2020-12-23 09:38:01,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:01,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:38:01,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476527959] [2020-12-23 09:38:01,737 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:38:01,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:01,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:38:01,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:01,739 INFO L87 Difference]: Start difference. First operand 84800 states and 110236 transitions. Second operand 5 states. [2020-12-23 09:38:14,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:14,564 INFO L93 Difference]: Finished difference Result 204025 states and 266882 transitions. [2020-12-23 09:38:14,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:38:14,564 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2020-12-23 09:38:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:14,757 INFO L225 Difference]: With dead ends: 204025 [2020-12-23 09:38:14,757 INFO L226 Difference]: Without dead ends: 119328 [2020-12-23 09:38:14,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:38:15,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119328 states. [2020-12-23 09:38:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119328 to 85676. [2020-12-23 09:38:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85676 states. [2020-12-23 09:38:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85676 states to 85676 states and 110543 transitions. [2020-12-23 09:38:24,565 INFO L78 Accepts]: Start accepts. Automaton has 85676 states and 110543 transitions. Word has length 153 [2020-12-23 09:38:24,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:24,565 INFO L481 AbstractCegarLoop]: Abstraction has 85676 states and 110543 transitions. [2020-12-23 09:38:24,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:38:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 85676 states and 110543 transitions. [2020-12-23 09:38:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-23 09:38:24,571 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:24,571 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:38:24,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 09:38:24,571 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1315130539, now seen corresponding path program 1 times [2020-12-23 09:38:24,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:24,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115303047] [2020-12-23 09:38:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 09:38:24,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115303047] [2020-12-23 09:38:24,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:24,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:24,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161582098] [2020-12-23 09:38:24,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:24,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:24,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:24,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:24,699 INFO L87 Difference]: Start difference. First operand 85676 states and 110543 transitions. Second operand 4 states. [2020-12-23 09:38:39,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:38:39,007 INFO L93 Difference]: Finished difference Result 210711 states and 271532 transitions. [2020-12-23 09:38:39,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:38:39,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2020-12-23 09:38:39,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:38:39,316 INFO L225 Difference]: With dead ends: 210711 [2020-12-23 09:38:39,316 INFO L226 Difference]: Without dead ends: 125140 [2020-12-23 09:38:39,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:38:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125140 states. [2020-12-23 09:38:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125140 to 85676. [2020-12-23 09:38:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85676 states. [2020-12-23 09:38:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85676 states to 85676 states and 110326 transitions. [2020-12-23 09:38:49,421 INFO L78 Accepts]: Start accepts. Automaton has 85676 states and 110326 transitions. Word has length 153 [2020-12-23 09:38:49,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:38:49,421 INFO L481 AbstractCegarLoop]: Abstraction has 85676 states and 110326 transitions. [2020-12-23 09:38:49,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:38:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 85676 states and 110326 transitions. [2020-12-23 09:38:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-23 09:38:49,438 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:38:49,438 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:38:49,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 09:38:49,439 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:38:49,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:38:49,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1113306605, now seen corresponding path program 1 times [2020-12-23 09:38:49,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:38:49,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645165399] [2020-12-23 09:38:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:38:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:38:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 09:38:49,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645165399] [2020-12-23 09:38:49,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:38:49,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:38:49,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865927039] [2020-12-23 09:38:49,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:38:49,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:38:49,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:38:49,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:38:49,705 INFO L87 Difference]: Start difference. First operand 85676 states and 110326 transitions. Second operand 4 states. [2020-12-23 09:39:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:04,199 INFO L93 Difference]: Finished difference Result 210710 states and 271043 transitions. [2020-12-23 09:39:04,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:39:04,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2020-12-23 09:39:04,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:04,538 INFO L225 Difference]: With dead ends: 210710 [2020-12-23 09:39:04,538 INFO L226 Difference]: Without dead ends: 125140 [2020-12-23 09:39:04,612 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:39:04,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125140 states. [2020-12-23 09:39:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125140 to 85676. [2020-12-23 09:39:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85676 states. [2020-12-23 09:39:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85676 states to 85676 states and 110109 transitions. [2020-12-23 09:39:14,646 INFO L78 Accepts]: Start accepts. Automaton has 85676 states and 110109 transitions. Word has length 153 [2020-12-23 09:39:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:39:14,647 INFO L481 AbstractCegarLoop]: Abstraction has 85676 states and 110109 transitions. [2020-12-23 09:39:14,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:39:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 85676 states and 110109 transitions. [2020-12-23 09:39:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-12-23 09:39:14,660 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:39:14,660 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:39:14,660 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 09:39:14,660 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:39:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:39:14,661 INFO L82 PathProgramCache]: Analyzing trace with hash -552606827, now seen corresponding path program 1 times [2020-12-23 09:39:14,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:39:14,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287383675] [2020-12-23 09:39:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:39:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:39:14,727 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-12-23 09:39:14,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287383675] [2020-12-23 09:39:14,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:39:14,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:39:14,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924383555] [2020-12-23 09:39:14,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:39:14,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:39:14,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:39:14,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:39:14,729 INFO L87 Difference]: Start difference. First operand 85676 states and 110109 transitions. Second operand 4 states. [2020-12-23 09:39:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:39:29,787 INFO L93 Difference]: Finished difference Result 210709 states and 270554 transitions. [2020-12-23 09:39:29,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:39:29,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2020-12-23 09:39:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:39:29,965 INFO L225 Difference]: With dead ends: 210709 [2020-12-23 09:39:29,965 INFO L226 Difference]: Without dead ends: 125140 [2020-12-23 09:39:30,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:39:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125140 states.