/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.15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:32:04,479 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:32:04,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:32:04,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:32:04,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:32:04,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:32:04,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:32:04,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:32:04,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:32:04,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:32:04,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:32:04,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:32:04,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:32:04,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:32:04,575 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:32:04,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:32:04,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:32:04,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:32:04,590 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:32:04,592 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:32:04,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:32:04,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:32:04,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:32:04,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:32:04,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:32:04,608 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:32:04,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:32:04,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:32:04,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:32:04,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:32:04,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:32:04,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:32:04,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:32:04,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:32:04,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:32:04,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:32:04,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:32:04,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:32:04,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:32:04,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:32:04,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:32:04,624 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:32:04,674 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:32:04,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:32:04,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:32:04,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:32:04,679 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:32:04,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:32:04,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:32:04,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:32:04,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:32:04,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:32:04,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:32:04,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:32:04,681 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:32:04,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:32:04,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:32:04,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:32:04,682 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:32:04,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:32:04,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:32:04,683 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:32:04,683 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:32:04,683 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:32:04,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:32:04,684 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:32:04,684 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:32:04,684 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:32:05,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:32:05,091 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:32:05,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:32:05,095 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:32:05,096 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:32:05,097 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.15.cil.c [2021-01-06 19:32:05,189 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b54c1cd5d/74c5f76db5264571af350a1d04dfff80/FLAG66e0fdf7f [2021-01-06 19:32:05,843 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:32:05,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.15.cil.c [2021-01-06 19:32:05,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b54c1cd5d/74c5f76db5264571af350a1d04dfff80/FLAG66e0fdf7f [2021-01-06 19:32:06,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/b54c1cd5d/74c5f76db5264571af350a1d04dfff80 [2021-01-06 19:32:06,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:32:06,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:32:06,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:32:06,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:32:06,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:32:06,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:06,172 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e330fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06, skipping insertion in model container [2021-01-06 19:32:06,173 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:06,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:32:06,275 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:32:06,500 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.15.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] [2021-01-06 19:32:06,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:32:06,827 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:32:06,840 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.15.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] [2021-01-06 19:32:06,936 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:32:06,977 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:32:06,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06 WrapperNode [2021-01-06 19:32:06,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:32:06,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:32:06,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:32:06,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:32:06,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:07,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:07,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:32:07,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:32:07,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:32:07,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:32:07,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:07,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:07,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:07,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:07,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:07,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:07,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (1/1) ... [2021-01-06 19:32:07,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:32:07,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:32:07,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:32:07,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:32:07,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:32:07,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:32:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:32:07,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:32:07,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:32:10,364 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:32:10,364 INFO L299 CfgBuilder]: Removed 589 assume(true) statements. [2021-01-06 19:32:10,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:32:10 BoogieIcfgContainer [2021-01-06 19:32:10,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:32:10,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:32:10,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:32:10,374 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:32:10,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:32:06" (1/3) ... [2021-01-06 19:32:10,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d575dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:32:10, skipping insertion in model container [2021-01-06 19:32:10,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:06" (2/3) ... [2021-01-06 19:32:10,376 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d575dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:32:10, skipping insertion in model container [2021-01-06 19:32:10,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:32:10" (3/3) ... [2021-01-06 19:32:10,378 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.15.cil.c [2021-01-06 19:32:10,384 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:32:10,391 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:32:10,410 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:32:10,447 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:32:10,447 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:32:10,447 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:32:10,447 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:32:10,447 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:32:10,448 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:32:10,448 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:32:10,448 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:32:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states. [2021-01-06 19:32:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:10,505 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:10,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:10,507 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:10,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:10,514 INFO L82 PathProgramCache]: Analyzing trace with hash 735925127, now seen corresponding path program 1 times [2021-01-06 19:32:10,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:10,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442188087] [2021-01-06 19:32:10,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:10,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442188087] [2021-01-06 19:32:10,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:10,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:10,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199916136] [2021-01-06 19:32:10,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:10,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:10,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:10,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:10,923 INFO L87 Difference]: Start difference. First operand 1886 states. Second operand 3 states. [2021-01-06 19:32:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:11,146 INFO L93 Difference]: Finished difference Result 3767 states and 5677 transitions. [2021-01-06 19:32:11,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:11,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:11,190 INFO L225 Difference]: With dead ends: 3767 [2021-01-06 19:32:11,191 INFO L226 Difference]: Without dead ends: 1882 [2021-01-06 19:32:11,204 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:11,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2021-01-06 19:32:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2021-01-06 19:32:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2021-01-06 19:32:11,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2802 transitions. [2021-01-06 19:32:11,368 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2802 transitions. Word has length 167 [2021-01-06 19:32:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:11,369 INFO L481 AbstractCegarLoop]: Abstraction has 1882 states and 2802 transitions. [2021-01-06 19:32:11,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:11,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2802 transitions. [2021-01-06 19:32:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:11,383 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:11,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:11,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:32:11,386 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:11,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:11,387 INFO L82 PathProgramCache]: Analyzing trace with hash 237368325, now seen corresponding path program 1 times [2021-01-06 19:32:11,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:11,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726497251] [2021-01-06 19:32:11,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:11,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:11,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726497251] [2021-01-06 19:32:11,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:11,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:11,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975440305] [2021-01-06 19:32:11,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:11,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:11,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:11,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:11,581 INFO L87 Difference]: Start difference. First operand 1882 states and 2802 transitions. Second operand 3 states. [2021-01-06 19:32:11,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:11,670 INFO L93 Difference]: Finished difference Result 3751 states and 5582 transitions. [2021-01-06 19:32:11,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:11,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:11,681 INFO L225 Difference]: With dead ends: 3751 [2021-01-06 19:32:11,681 INFO L226 Difference]: Without dead ends: 1882 [2021-01-06 19:32:11,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2021-01-06 19:32:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1882. [2021-01-06 19:32:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1882 states. [2021-01-06 19:32:11,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2801 transitions. [2021-01-06 19:32:11,795 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2801 transitions. Word has length 167 [2021-01-06 19:32:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:11,798 INFO L481 AbstractCegarLoop]: Abstraction has 1882 states and 2801 transitions. [2021-01-06 19:32:11,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2801 transitions. [2021-01-06 19:32:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:11,801 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:11,801 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:11,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:32:11,802 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:11,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash 2006839939, now seen corresponding path program 1 times [2021-01-06 19:32:11,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:11,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138313129] [2021-01-06 19:32:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:12,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138313129] [2021-01-06 19:32:12,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:12,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:12,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167528181] [2021-01-06 19:32:12,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:12,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:12,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:12,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:12,036 INFO L87 Difference]: Start difference. First operand 1882 states and 2801 transitions. Second operand 3 states. [2021-01-06 19:32:12,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:12,289 INFO L93 Difference]: Finished difference Result 5360 states and 7953 transitions. [2021-01-06 19:32:12,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:12,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:12,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:12,308 INFO L225 Difference]: With dead ends: 5360 [2021-01-06 19:32:12,309 INFO L226 Difference]: Without dead ends: 3496 [2021-01-06 19:32:12,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:12,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2021-01-06 19:32:12,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 3494. [2021-01-06 19:32:12,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5163 transitions. [2021-01-06 19:32:12,455 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5163 transitions. Word has length 167 [2021-01-06 19:32:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:12,462 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5163 transitions. [2021-01-06 19:32:12,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5163 transitions. [2021-01-06 19:32:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:12,464 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:12,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:12,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:32:12,465 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:12,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:12,467 INFO L82 PathProgramCache]: Analyzing trace with hash -31533534, now seen corresponding path program 1 times [2021-01-06 19:32:12,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:12,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204897769] [2021-01-06 19:32:12,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:12,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204897769] [2021-01-06 19:32:12,623 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:12,623 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:12,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345998756] [2021-01-06 19:32:12,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:12,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:12,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:12,626 INFO L87 Difference]: Start difference. First operand 3494 states and 5163 transitions. Second operand 4 states. [2021-01-06 19:32:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:12,994 INFO L93 Difference]: Finished difference Result 8582 states and 12658 transitions. [2021-01-06 19:32:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:12,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:13,023 INFO L225 Difference]: With dead ends: 8582 [2021-01-06 19:32:13,024 INFO L226 Difference]: Without dead ends: 5107 [2021-01-06 19:32:13,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:13,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5107 states. [2021-01-06 19:32:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5107 to 3494. [2021-01-06 19:32:13,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5160 transitions. [2021-01-06 19:32:13,280 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5160 transitions. Word has length 167 [2021-01-06 19:32:13,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:13,281 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5160 transitions. [2021-01-06 19:32:13,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5160 transitions. [2021-01-06 19:32:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:13,284 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:13,284 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:13,284 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:32:13,285 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:13,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash 354328868, now seen corresponding path program 1 times [2021-01-06 19:32:13,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:13,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328955957] [2021-01-06 19:32:13,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:13,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328955957] [2021-01-06 19:32:13,420 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:13,420 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:13,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094490075] [2021-01-06 19:32:13,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:13,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:13,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:13,424 INFO L87 Difference]: Start difference. First operand 3494 states and 5160 transitions. Second operand 4 states. [2021-01-06 19:32:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:13,856 INFO L93 Difference]: Finished difference Result 8580 states and 12648 transitions. [2021-01-06 19:32:13,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:13,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:13,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:13,881 INFO L225 Difference]: With dead ends: 8580 [2021-01-06 19:32:13,882 INFO L226 Difference]: Without dead ends: 5106 [2021-01-06 19:32:13,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5106 states. [2021-01-06 19:32:14,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5106 to 3494. [2021-01-06 19:32:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:14,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5157 transitions. [2021-01-06 19:32:14,092 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5157 transitions. Word has length 167 [2021-01-06 19:32:14,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:14,092 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5157 transitions. [2021-01-06 19:32:14,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5157 transitions. [2021-01-06 19:32:14,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:14,094 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:14,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:14,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:32:14,095 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:14,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:14,096 INFO L82 PathProgramCache]: Analyzing trace with hash 89681378, now seen corresponding path program 1 times [2021-01-06 19:32:14,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:14,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606654649] [2021-01-06 19:32:14,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:14,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606654649] [2021-01-06 19:32:14,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:14,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:14,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634025754] [2021-01-06 19:32:14,243 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:14,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:14,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:14,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:14,244 INFO L87 Difference]: Start difference. First operand 3494 states and 5157 transitions. Second operand 3 states. [2021-01-06 19:32:14,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:14,436 INFO L93 Difference]: Finished difference Result 6966 states and 10278 transitions. [2021-01-06 19:32:14,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:14,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:14,458 INFO L225 Difference]: With dead ends: 6966 [2021-01-06 19:32:14,458 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:14,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:14,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:14,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5149 transitions. [2021-01-06 19:32:14,688 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5149 transitions. Word has length 167 [2021-01-06 19:32:14,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:14,688 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5149 transitions. [2021-01-06 19:32:14,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5149 transitions. [2021-01-06 19:32:14,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:14,690 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:14,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:14,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:32:14,691 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:14,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:14,698 INFO L82 PathProgramCache]: Analyzing trace with hash -2077503070, now seen corresponding path program 1 times [2021-01-06 19:32:14,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:14,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253704640] [2021-01-06 19:32:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:14,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:14,782 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253704640] [2021-01-06 19:32:14,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:14,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:14,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820773827] [2021-01-06 19:32:14,783 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:14,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:14,784 INFO L87 Difference]: Start difference. First operand 3494 states and 5149 transitions. Second operand 3 states. [2021-01-06 19:32:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:15,029 INFO L93 Difference]: Finished difference Result 6965 states and 10261 transitions. [2021-01-06 19:32:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:15,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:15,046 INFO L225 Difference]: With dead ends: 6965 [2021-01-06 19:32:15,046 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:15,052 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:15,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:15,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5141 transitions. [2021-01-06 19:32:15,240 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5141 transitions. Word has length 167 [2021-01-06 19:32:15,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:15,240 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5141 transitions. [2021-01-06 19:32:15,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5141 transitions. [2021-01-06 19:32:15,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:15,242 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:15,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:15,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:32:15,243 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:15,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:15,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1870460386, now seen corresponding path program 1 times [2021-01-06 19:32:15,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:15,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631948524] [2021-01-06 19:32:15,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:15,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631948524] [2021-01-06 19:32:15,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:15,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:15,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620712892] [2021-01-06 19:32:15,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:15,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:15,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:15,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:15,340 INFO L87 Difference]: Start difference. First operand 3494 states and 5141 transitions. Second operand 4 states. [2021-01-06 19:32:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:15,823 INFO L93 Difference]: Finished difference Result 8572 states and 12592 transitions. [2021-01-06 19:32:15,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:15,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:15,847 INFO L225 Difference]: With dead ends: 8572 [2021-01-06 19:32:15,848 INFO L226 Difference]: Without dead ends: 5102 [2021-01-06 19:32:15,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:15,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5102 states. [2021-01-06 19:32:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5102 to 3494. [2021-01-06 19:32:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:16,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5138 transitions. [2021-01-06 19:32:16,064 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5138 transitions. Word has length 167 [2021-01-06 19:32:16,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:16,065 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5138 transitions. [2021-01-06 19:32:16,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:16,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5138 transitions. [2021-01-06 19:32:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:16,067 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:16,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:16,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:32:16,068 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:16,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2086219360, now seen corresponding path program 1 times [2021-01-06 19:32:16,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:16,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510954213] [2021-01-06 19:32:16,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:16,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510954213] [2021-01-06 19:32:16,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:16,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:16,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112614246] [2021-01-06 19:32:16,150 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:16,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:16,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:16,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:16,153 INFO L87 Difference]: Start difference. First operand 3494 states and 5138 transitions. Second operand 3 states. [2021-01-06 19:32:16,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:16,382 INFO L93 Difference]: Finished difference Result 6963 states and 10237 transitions. [2021-01-06 19:32:16,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:16,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:16,399 INFO L225 Difference]: With dead ends: 6963 [2021-01-06 19:32:16,399 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:16,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5130 transitions. [2021-01-06 19:32:16,629 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5130 transitions. Word has length 167 [2021-01-06 19:32:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:16,630 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5130 transitions. [2021-01-06 19:32:16,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5130 transitions. [2021-01-06 19:32:16,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:16,633 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:16,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:16,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:32:16,634 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:16,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:16,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1384905248, now seen corresponding path program 1 times [2021-01-06 19:32:16,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:16,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695720524] [2021-01-06 19:32:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:16,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:16,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695720524] [2021-01-06 19:32:16,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:16,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:16,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297313697] [2021-01-06 19:32:16,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:16,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:16,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:16,734 INFO L87 Difference]: Start difference. First operand 3494 states and 5130 transitions. Second operand 3 states. [2021-01-06 19:32:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:16,966 INFO L93 Difference]: Finished difference Result 6962 states and 10220 transitions. [2021-01-06 19:32:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:16,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:16,978 INFO L225 Difference]: With dead ends: 6962 [2021-01-06 19:32:16,978 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:16,986 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:17,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5122 transitions. [2021-01-06 19:32:17,201 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5122 transitions. Word has length 167 [2021-01-06 19:32:17,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:17,201 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5122 transitions. [2021-01-06 19:32:17,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:17,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5122 transitions. [2021-01-06 19:32:17,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:17,203 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:17,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:17,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:32:17,204 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:17,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:17,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1223734880, now seen corresponding path program 1 times [2021-01-06 19:32:17,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:17,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491816080] [2021-01-06 19:32:17,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:17,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491816080] [2021-01-06 19:32:17,270 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:17,270 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:17,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592672222] [2021-01-06 19:32:17,271 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:17,271 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:17,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:17,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:17,272 INFO L87 Difference]: Start difference. First operand 3494 states and 5122 transitions. Second operand 3 states. [2021-01-06 19:32:17,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:17,485 INFO L93 Difference]: Finished difference Result 6961 states and 10203 transitions. [2021-01-06 19:32:17,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:17,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:17,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:17,493 INFO L225 Difference]: With dead ends: 6961 [2021-01-06 19:32:17,493 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:17,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5114 transitions. [2021-01-06 19:32:17,684 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5114 transitions. Word has length 167 [2021-01-06 19:32:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:17,684 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5114 transitions. [2021-01-06 19:32:17,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5114 transitions. [2021-01-06 19:32:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:17,686 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:17,687 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:17,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:32:17,687 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:17,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1357083168, now seen corresponding path program 1 times [2021-01-06 19:32:17,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:17,690 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719713889] [2021-01-06 19:32:17,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:17,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719713889] [2021-01-06 19:32:17,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:17,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:17,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075957409] [2021-01-06 19:32:17,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:17,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:17,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:17,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:17,794 INFO L87 Difference]: Start difference. First operand 3494 states and 5114 transitions. Second operand 3 states. [2021-01-06 19:32:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:18,010 INFO L93 Difference]: Finished difference Result 6960 states and 10186 transitions. [2021-01-06 19:32:18,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:18,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:18,019 INFO L225 Difference]: With dead ends: 6960 [2021-01-06 19:32:18,020 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:18,026 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:18,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5106 transitions. [2021-01-06 19:32:18,224 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5106 transitions. Word has length 167 [2021-01-06 19:32:18,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:18,224 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5106 transitions. [2021-01-06 19:32:18,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5106 transitions. [2021-01-06 19:32:18,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:18,226 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:18,227 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:18,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:32:18,227 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:18,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash -946472802, now seen corresponding path program 1 times [2021-01-06 19:32:18,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:18,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893124885] [2021-01-06 19:32:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:18,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893124885] [2021-01-06 19:32:18,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:18,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:18,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63537350] [2021-01-06 19:32:18,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:18,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:18,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:18,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:18,309 INFO L87 Difference]: Start difference. First operand 3494 states and 5106 transitions. Second operand 3 states. [2021-01-06 19:32:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:18,521 INFO L93 Difference]: Finished difference Result 6958 states and 10167 transitions. [2021-01-06 19:32:18,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:18,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:18,529 INFO L225 Difference]: With dead ends: 6958 [2021-01-06 19:32:18,530 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:18,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:18,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5098 transitions. [2021-01-06 19:32:18,798 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5098 transitions. Word has length 167 [2021-01-06 19:32:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:18,798 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5098 transitions. [2021-01-06 19:32:18,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5098 transitions. [2021-01-06 19:32:18,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:18,802 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:18,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:18,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:32:18,803 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:18,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:18,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1159127970, now seen corresponding path program 1 times [2021-01-06 19:32:18,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:18,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416345345] [2021-01-06 19:32:18,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:18,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:18,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416345345] [2021-01-06 19:32:18,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:18,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:18,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309312685] [2021-01-06 19:32:18,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:18,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:18,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:18,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:18,896 INFO L87 Difference]: Start difference. First operand 3494 states and 5098 transitions. Second operand 3 states. [2021-01-06 19:32:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:19,108 INFO L93 Difference]: Finished difference Result 6957 states and 10150 transitions. [2021-01-06 19:32:19,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:19,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:19,117 INFO L225 Difference]: With dead ends: 6957 [2021-01-06 19:32:19,117 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:19,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5090 transitions. [2021-01-06 19:32:19,378 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5090 transitions. Word has length 167 [2021-01-06 19:32:19,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:19,378 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5090 transitions. [2021-01-06 19:32:19,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5090 transitions. [2021-01-06 19:32:19,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:19,380 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:19,381 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:19,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:32:19,381 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:19,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1027440482, now seen corresponding path program 1 times [2021-01-06 19:32:19,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:19,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192326908] [2021-01-06 19:32:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:19,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:19,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192326908] [2021-01-06 19:32:19,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:19,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:19,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104276003] [2021-01-06 19:32:19,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:19,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:19,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:19,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:19,451 INFO L87 Difference]: Start difference. First operand 3494 states and 5090 transitions. Second operand 4 states. [2021-01-06 19:32:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:19,981 INFO L93 Difference]: Finished difference Result 8458 states and 12313 transitions. [2021-01-06 19:32:19,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:19,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:19,992 INFO L225 Difference]: With dead ends: 8458 [2021-01-06 19:32:19,993 INFO L226 Difference]: Without dead ends: 4996 [2021-01-06 19:32:20,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2021-01-06 19:32:20,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 3494. [2021-01-06 19:32:20,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5087 transitions. [2021-01-06 19:32:20,228 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5087 transitions. Word has length 167 [2021-01-06 19:32:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:20,228 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5087 transitions. [2021-01-06 19:32:20,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5087 transitions. [2021-01-06 19:32:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:20,230 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:20,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:20,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:32:20,231 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:20,232 INFO L82 PathProgramCache]: Analyzing trace with hash -609551780, now seen corresponding path program 1 times [2021-01-06 19:32:20,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:20,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589906229] [2021-01-06 19:32:20,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:20,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589906229] [2021-01-06 19:32:20,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:20,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:20,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993058894] [2021-01-06 19:32:20,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:20,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:20,350 INFO L87 Difference]: Start difference. First operand 3494 states and 5087 transitions. Second operand 3 states. [2021-01-06 19:32:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:20,667 INFO L93 Difference]: Finished difference Result 6955 states and 10126 transitions. [2021-01-06 19:32:20,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:20,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:20,678 INFO L225 Difference]: With dead ends: 6955 [2021-01-06 19:32:20,678 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:20,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5051 transitions. [2021-01-06 19:32:20,979 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5051 transitions. Word has length 167 [2021-01-06 19:32:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:20,980 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5051 transitions. [2021-01-06 19:32:20,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5051 transitions. [2021-01-06 19:32:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:20,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:20,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:20,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:32:20,983 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:20,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:20,983 INFO L82 PathProgramCache]: Analyzing trace with hash 655388316, now seen corresponding path program 1 times [2021-01-06 19:32:20,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:20,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744546780] [2021-01-06 19:32:20,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:21,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744546780] [2021-01-06 19:32:21,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:21,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:21,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677690735] [2021-01-06 19:32:21,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:21,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:21,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:21,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:21,058 INFO L87 Difference]: Start difference. First operand 3494 states and 5051 transitions. Second operand 4 states. [2021-01-06 19:32:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:21,603 INFO L93 Difference]: Finished difference Result 8454 states and 12214 transitions. [2021-01-06 19:32:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:21,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:21,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:21,616 INFO L225 Difference]: With dead ends: 8454 [2021-01-06 19:32:21,616 INFO L226 Difference]: Without dead ends: 4994 [2021-01-06 19:32:21,624 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:21,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4994 states. [2021-01-06 19:32:21,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4994 to 3494. [2021-01-06 19:32:21,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5048 transitions. [2021-01-06 19:32:21,916 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5048 transitions. Word has length 167 [2021-01-06 19:32:21,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:21,916 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5048 transitions. [2021-01-06 19:32:21,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:21,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5048 transitions. [2021-01-06 19:32:21,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:21,918 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:21,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:21,918 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:32:21,919 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:21,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:21,919 INFO L82 PathProgramCache]: Analyzing trace with hash -962052134, now seen corresponding path program 1 times [2021-01-06 19:32:21,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:21,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861833298] [2021-01-06 19:32:21,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:21,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:21,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861833298] [2021-01-06 19:32:21,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:21,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:21,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690326343] [2021-01-06 19:32:21,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:21,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:21,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:21,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:21,988 INFO L87 Difference]: Start difference. First operand 3494 states and 5048 transitions. Second operand 3 states. [2021-01-06 19:32:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:22,256 INFO L93 Difference]: Finished difference Result 6953 states and 10046 transitions. [2021-01-06 19:32:22,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:22,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:22,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:22,265 INFO L225 Difference]: With dead ends: 6953 [2021-01-06 19:32:22,265 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:22,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:22,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5012 transitions. [2021-01-06 19:32:22,504 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5012 transitions. Word has length 167 [2021-01-06 19:32:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:22,504 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5012 transitions. [2021-01-06 19:32:22,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:22,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5012 transitions. [2021-01-06 19:32:22,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:22,507 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:22,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:22,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:32:22,507 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:22,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:22,508 INFO L82 PathProgramCache]: Analyzing trace with hash -379730918, now seen corresponding path program 1 times [2021-01-06 19:32:22,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:22,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799201086] [2021-01-06 19:32:22,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:22,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799201086] [2021-01-06 19:32:22,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:22,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:22,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604120929] [2021-01-06 19:32:22,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:22,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:22,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:22,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:22,579 INFO L87 Difference]: Start difference. First operand 3494 states and 5012 transitions. Second operand 4 states. [2021-01-06 19:32:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:23,145 INFO L93 Difference]: Finished difference Result 8450 states and 12115 transitions. [2021-01-06 19:32:23,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:23,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:23,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:23,157 INFO L225 Difference]: With dead ends: 8450 [2021-01-06 19:32:23,158 INFO L226 Difference]: Without dead ends: 4992 [2021-01-06 19:32:23,165 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:23,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4992 states. [2021-01-06 19:32:23,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4992 to 3494. [2021-01-06 19:32:23,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5009 transitions. [2021-01-06 19:32:23,419 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5009 transitions. Word has length 167 [2021-01-06 19:32:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:23,419 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5009 transitions. [2021-01-06 19:32:23,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:23,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5009 transitions. [2021-01-06 19:32:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:23,421 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:23,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:23,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:32:23,422 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:23,423 INFO L82 PathProgramCache]: Analyzing trace with hash -90911528, now seen corresponding path program 1 times [2021-01-06 19:32:23,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:23,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806559076] [2021-01-06 19:32:23,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:23,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:23,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806559076] [2021-01-06 19:32:23,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:23,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:23,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008566915] [2021-01-06 19:32:23,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:23,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:23,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:23,515 INFO L87 Difference]: Start difference. First operand 3494 states and 5009 transitions. Second operand 4 states. [2021-01-06 19:32:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:24,062 INFO L93 Difference]: Finished difference Result 8446 states and 12101 transitions. [2021-01-06 19:32:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:24,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:24,075 INFO L225 Difference]: With dead ends: 8446 [2021-01-06 19:32:24,075 INFO L226 Difference]: Without dead ends: 4990 [2021-01-06 19:32:24,082 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:24,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4990 states. [2021-01-06 19:32:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4990 to 3494. [2021-01-06 19:32:24,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:24,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5006 transitions. [2021-01-06 19:32:24,410 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5006 transitions. Word has length 167 [2021-01-06 19:32:24,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:24,410 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5006 transitions. [2021-01-06 19:32:24,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5006 transitions. [2021-01-06 19:32:24,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:24,412 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:24,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:24,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:32:24,413 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash 584248598, now seen corresponding path program 1 times [2021-01-06 19:32:24,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:24,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128841529] [2021-01-06 19:32:24,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:24,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:24,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128841529] [2021-01-06 19:32:24,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:24,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:24,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973096119] [2021-01-06 19:32:24,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:24,479 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:24,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:24,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:24,480 INFO L87 Difference]: Start difference. First operand 3494 states and 5006 transitions. Second operand 4 states. [2021-01-06 19:32:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:25,044 INFO L93 Difference]: Finished difference Result 8444 states and 12091 transitions. [2021-01-06 19:32:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:25,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:25,057 INFO L225 Difference]: With dead ends: 8444 [2021-01-06 19:32:25,058 INFO L226 Difference]: Without dead ends: 4989 [2021-01-06 19:32:25,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4989 states. [2021-01-06 19:32:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4989 to 3494. [2021-01-06 19:32:25,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5003 transitions. [2021-01-06 19:32:25,379 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5003 transitions. Word has length 167 [2021-01-06 19:32:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:25,379 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5003 transitions. [2021-01-06 19:32:25,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5003 transitions. [2021-01-06 19:32:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:25,382 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:25,382 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:25,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:32:25,383 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:25,383 INFO L82 PathProgramCache]: Analyzing trace with hash -363803368, now seen corresponding path program 1 times [2021-01-06 19:32:25,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:25,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226114194] [2021-01-06 19:32:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:25,468 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226114194] [2021-01-06 19:32:25,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:25,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:25,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635768566] [2021-01-06 19:32:25,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:25,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:25,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:25,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:25,474 INFO L87 Difference]: Start difference. First operand 3494 states and 5003 transitions. Second operand 4 states. [2021-01-06 19:32:26,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:26,151 INFO L93 Difference]: Finished difference Result 8442 states and 12081 transitions. [2021-01-06 19:32:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:26,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:26,167 INFO L225 Difference]: With dead ends: 8442 [2021-01-06 19:32:26,167 INFO L226 Difference]: Without dead ends: 4988 [2021-01-06 19:32:26,174 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:26,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2021-01-06 19:32:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 3494. [2021-01-06 19:32:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 5000 transitions. [2021-01-06 19:32:26,424 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 5000 transitions. Word has length 167 [2021-01-06 19:32:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:26,425 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 5000 transitions. [2021-01-06 19:32:26,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:26,425 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 5000 transitions. [2021-01-06 19:32:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:26,427 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:26,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:26,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:32:26,428 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash -948575018, now seen corresponding path program 1 times [2021-01-06 19:32:26,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:26,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745108711] [2021-01-06 19:32:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:26,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745108711] [2021-01-06 19:32:26,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:26,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:26,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37904470] [2021-01-06 19:32:26,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:26,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:26,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:26,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:26,490 INFO L87 Difference]: Start difference. First operand 3494 states and 5000 transitions. Second operand 4 states. [2021-01-06 19:32:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:26,999 INFO L93 Difference]: Finished difference Result 8440 states and 12071 transitions. [2021-01-06 19:32:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:27,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:27,016 INFO L225 Difference]: With dead ends: 8440 [2021-01-06 19:32:27,016 INFO L226 Difference]: Without dead ends: 4987 [2021-01-06 19:32:27,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:27,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2021-01-06 19:32:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 3494. [2021-01-06 19:32:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 4997 transitions. [2021-01-06 19:32:27,300 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 4997 transitions. Word has length 167 [2021-01-06 19:32:27,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:27,300 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 4997 transitions. [2021-01-06 19:32:27,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 4997 transitions. [2021-01-06 19:32:27,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:27,302 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:27,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:27,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:32:27,302 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:27,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:27,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1383080616, now seen corresponding path program 1 times [2021-01-06 19:32:27,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:27,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896181615] [2021-01-06 19:32:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:27,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896181615] [2021-01-06 19:32:27,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:27,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:27,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377184839] [2021-01-06 19:32:27,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:27,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:27,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:27,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:27,390 INFO L87 Difference]: Start difference. First operand 3494 states and 4997 transitions. Second operand 4 states. [2021-01-06 19:32:27,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:27,997 INFO L93 Difference]: Finished difference Result 8438 states and 12061 transitions. [2021-01-06 19:32:27,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:27,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:28,007 INFO L225 Difference]: With dead ends: 8438 [2021-01-06 19:32:28,007 INFO L226 Difference]: Without dead ends: 4986 [2021-01-06 19:32:28,012 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:28,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4986 states. [2021-01-06 19:32:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4986 to 3494. [2021-01-06 19:32:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 4994 transitions. [2021-01-06 19:32:28,348 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 4994 transitions. Word has length 167 [2021-01-06 19:32:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:28,348 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 4994 transitions. [2021-01-06 19:32:28,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 4994 transitions. [2021-01-06 19:32:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:28,350 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:28,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:28,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:32:28,351 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:28,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:28,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1812738922, now seen corresponding path program 1 times [2021-01-06 19:32:28,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:28,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240455149] [2021-01-06 19:32:28,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:28,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:28,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240455149] [2021-01-06 19:32:28,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:28,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:28,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722500072] [2021-01-06 19:32:28,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:28,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:28,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:28,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:28,489 INFO L87 Difference]: Start difference. First operand 3494 states and 4994 transitions. Second operand 3 states. [2021-01-06 19:32:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:28,833 INFO L93 Difference]: Finished difference Result 6945 states and 9929 transitions. [2021-01-06 19:32:28,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:28,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:28,839 INFO L225 Difference]: With dead ends: 6945 [2021-01-06 19:32:28,839 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:28,844 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:28,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:29,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 4958 transitions. [2021-01-06 19:32:29,132 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 4958 transitions. Word has length 167 [2021-01-06 19:32:29,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:29,133 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 4958 transitions. [2021-01-06 19:32:29,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 4958 transitions. [2021-01-06 19:32:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:29,134 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:29,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:29,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:32:29,134 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:29,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash -965822539, now seen corresponding path program 1 times [2021-01-06 19:32:29,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:29,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593581889] [2021-01-06 19:32:29,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:29,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593581889] [2021-01-06 19:32:29,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:29,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:29,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064530814] [2021-01-06 19:32:29,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:29,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:29,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:29,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:29,198 INFO L87 Difference]: Start difference. First operand 3494 states and 4958 transitions. Second operand 3 states. [2021-01-06 19:32:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:29,483 INFO L93 Difference]: Finished difference Result 6944 states and 9856 transitions. [2021-01-06 19:32:29,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:29,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2021-01-06 19:32:29,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:29,491 INFO L225 Difference]: With dead ends: 6944 [2021-01-06 19:32:29,491 INFO L226 Difference]: Without dead ends: 3494 [2021-01-06 19:32:29,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2021-01-06 19:32:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 3494. [2021-01-06 19:32:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3494 states. [2021-01-06 19:32:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3494 states to 3494 states and 4922 transitions. [2021-01-06 19:32:29,844 INFO L78 Accepts]: Start accepts. Automaton has 3494 states and 4922 transitions. Word has length 167 [2021-01-06 19:32:29,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:29,844 INFO L481 AbstractCegarLoop]: Abstraction has 3494 states and 4922 transitions. [2021-01-06 19:32:29,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 3494 states and 4922 transitions. [2021-01-06 19:32:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:29,846 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:29,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:29,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:32:29,847 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash -18784653, now seen corresponding path program 1 times [2021-01-06 19:32:29,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:29,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49816838] [2021-01-06 19:32:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:29,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49816838] [2021-01-06 19:32:29,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:29,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:29,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196820929] [2021-01-06 19:32:29,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:29,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:29,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:29,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:29,917 INFO L87 Difference]: Start difference. First operand 3494 states and 4922 transitions. Second operand 5 states. [2021-01-06 19:32:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:30,852 INFO L93 Difference]: Finished difference Result 10708 states and 15152 transitions. [2021-01-06 19:32:30,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:30,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2021-01-06 19:32:30,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:30,865 INFO L225 Difference]: With dead ends: 10708 [2021-01-06 19:32:30,865 INFO L226 Difference]: Without dead ends: 7265 [2021-01-06 19:32:30,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:32:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7265 states. [2021-01-06 19:32:31,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7265 to 3539. [2021-01-06 19:32:31,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3539 states. [2021-01-06 19:32:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3539 states to 3539 states and 4952 transitions. [2021-01-06 19:32:31,220 INFO L78 Accepts]: Start accepts. Automaton has 3539 states and 4952 transitions. Word has length 167 [2021-01-06 19:32:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:31,221 INFO L481 AbstractCegarLoop]: Abstraction has 3539 states and 4952 transitions. [2021-01-06 19:32:31,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3539 states and 4952 transitions. [2021-01-06 19:32:31,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:31,222 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:31,222 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:31,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:32:31,222 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:31,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1861260367, now seen corresponding path program 1 times [2021-01-06 19:32:31,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:31,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042603757] [2021-01-06 19:32:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:31,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042603757] [2021-01-06 19:32:31,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:31,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:31,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22007226] [2021-01-06 19:32:31,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:31,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:31,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:31,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:31,285 INFO L87 Difference]: Start difference. First operand 3539 states and 4952 transitions. Second operand 4 states. [2021-01-06 19:32:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:32,338 INFO L93 Difference]: Finished difference Result 13423 states and 18762 transitions. [2021-01-06 19:32:32,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:32,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:32,352 INFO L225 Difference]: With dead ends: 13423 [2021-01-06 19:32:32,352 INFO L226 Difference]: Without dead ends: 9930 [2021-01-06 19:32:32,360 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9930 states. [2021-01-06 19:32:33,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9930 to 9540. [2021-01-06 19:32:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9540 states. [2021-01-06 19:32:33,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9540 states to 9540 states and 13257 transitions. [2021-01-06 19:32:33,090 INFO L78 Accepts]: Start accepts. Automaton has 9540 states and 13257 transitions. Word has length 167 [2021-01-06 19:32:33,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:33,090 INFO L481 AbstractCegarLoop]: Abstraction has 9540 states and 13257 transitions. [2021-01-06 19:32:33,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:33,090 INFO L276 IsEmpty]: Start isEmpty. Operand 9540 states and 13257 transitions. [2021-01-06 19:32:33,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:33,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:33,091 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:33,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:32:33,091 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:33,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:33,091 INFO L82 PathProgramCache]: Analyzing trace with hash 613801680, now seen corresponding path program 1 times [2021-01-06 19:32:33,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:33,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961977138] [2021-01-06 19:32:33,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:33,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:33,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961977138] [2021-01-06 19:32:33,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:33,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:33,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594078557] [2021-01-06 19:32:33,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:33,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:33,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:33,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:33,147 INFO L87 Difference]: Start difference. First operand 9540 states and 13257 transitions. Second operand 5 states. [2021-01-06 19:32:34,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:34,599 INFO L93 Difference]: Finished difference Result 25255 states and 35165 transitions. [2021-01-06 19:32:34,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:34,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2021-01-06 19:32:34,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:34,616 INFO L225 Difference]: With dead ends: 25255 [2021-01-06 19:32:34,616 INFO L226 Difference]: Without dead ends: 15771 [2021-01-06 19:32:34,625 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:32:34,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15771 states. [2021-01-06 19:32:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15771 to 9627. [2021-01-06 19:32:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9627 states. [2021-01-06 19:32:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9627 states to 9627 states and 13291 transitions. [2021-01-06 19:32:35,446 INFO L78 Accepts]: Start accepts. Automaton has 9627 states and 13291 transitions. Word has length 167 [2021-01-06 19:32:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:35,447 INFO L481 AbstractCegarLoop]: Abstraction has 9627 states and 13291 transitions. [2021-01-06 19:32:35,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 9627 states and 13291 transitions. [2021-01-06 19:32:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:35,448 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:35,448 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:35,448 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:32:35,448 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:35,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1085158030, now seen corresponding path program 1 times [2021-01-06 19:32:35,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:35,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375476144] [2021-01-06 19:32:35,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:35,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375476144] [2021-01-06 19:32:35,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:35,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:35,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500991172] [2021-01-06 19:32:35,516 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:35,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:35,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:35,517 INFO L87 Difference]: Start difference. First operand 9627 states and 13291 transitions. Second operand 4 states. [2021-01-06 19:32:37,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:37,791 INFO L93 Difference]: Finished difference Result 37075 states and 51136 transitions. [2021-01-06 19:32:37,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:37,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:37,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:37,817 INFO L225 Difference]: With dead ends: 37075 [2021-01-06 19:32:37,817 INFO L226 Difference]: Without dead ends: 27513 [2021-01-06 19:32:37,827 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27513 states. [2021-01-06 19:32:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27513 to 26611. [2021-01-06 19:32:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26611 states. [2021-01-06 19:32:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26611 states to 26611 states and 36499 transitions. [2021-01-06 19:32:39,887 INFO L78 Accepts]: Start accepts. Automaton has 26611 states and 36499 transitions. Word has length 167 [2021-01-06 19:32:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:39,887 INFO L481 AbstractCegarLoop]: Abstraction has 26611 states and 36499 transitions. [2021-01-06 19:32:39,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:39,888 INFO L276 IsEmpty]: Start isEmpty. Operand 26611 states and 36499 transitions. [2021-01-06 19:32:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:39,889 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:39,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:39,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:32:39,889 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:39,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:39,890 INFO L82 PathProgramCache]: Analyzing trace with hash -152495059, now seen corresponding path program 1 times [2021-01-06 19:32:39,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:39,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203677689] [2021-01-06 19:32:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:39,961 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203677689] [2021-01-06 19:32:39,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:39,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:39,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451475831] [2021-01-06 19:32:39,961 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:39,962 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:39,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:39,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:39,962 INFO L87 Difference]: Start difference. First operand 26611 states and 36499 transitions. Second operand 5 states. [2021-01-06 19:32:43,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:43,448 INFO L93 Difference]: Finished difference Result 69544 states and 95738 transitions. [2021-01-06 19:32:43,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:43,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2021-01-06 19:32:43,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:43,496 INFO L225 Difference]: With dead ends: 69544 [2021-01-06 19:32:43,496 INFO L226 Difference]: Without dead ends: 43002 [2021-01-06 19:32:43,512 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:32:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43002 states. [2021-01-06 19:32:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43002 to 26854. [2021-01-06 19:32:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26854 states. [2021-01-06 19:32:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26854 states to 26854 states and 36595 transitions. [2021-01-06 19:32:45,897 INFO L78 Accepts]: Start accepts. Automaton has 26854 states and 36595 transitions. Word has length 167 [2021-01-06 19:32:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:45,898 INFO L481 AbstractCegarLoop]: Abstraction has 26854 states and 36595 transitions. [2021-01-06 19:32:45,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 26854 states and 36595 transitions. [2021-01-06 19:32:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:45,898 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:45,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:45,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:32:45,899 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:45,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:45,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1745001707, now seen corresponding path program 1 times [2021-01-06 19:32:45,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:45,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830781722] [2021-01-06 19:32:45,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:45,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:45,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830781722] [2021-01-06 19:32:45,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:45,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:45,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080169313] [2021-01-06 19:32:45,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:45,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:45,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:45,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:45,968 INFO L87 Difference]: Start difference. First operand 26854 states and 36595 transitions. Second operand 5 states. [2021-01-06 19:32:49,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:49,134 INFO L93 Difference]: Finished difference Result 59013 states and 80238 transitions. [2021-01-06 19:32:49,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:49,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2021-01-06 19:32:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:49,166 INFO L225 Difference]: With dead ends: 59013 [2021-01-06 19:32:49,166 INFO L226 Difference]: Without dead ends: 32235 [2021-01-06 19:32:49,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:32:49,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32235 states. [2021-01-06 19:32:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32235 to 26872. [2021-01-06 19:32:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26872 states. [2021-01-06 19:32:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26872 states to 26872 states and 36391 transitions. [2021-01-06 19:32:51,817 INFO L78 Accepts]: Start accepts. Automaton has 26872 states and 36391 transitions. Word has length 167 [2021-01-06 19:32:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:51,817 INFO L481 AbstractCegarLoop]: Abstraction has 26872 states and 36391 transitions. [2021-01-06 19:32:51,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:51,818 INFO L276 IsEmpty]: Start isEmpty. Operand 26872 states and 36391 transitions. [2021-01-06 19:32:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:32:51,818 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:51,819 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:51,819 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:32:51,819 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:51,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:51,819 INFO L82 PathProgramCache]: Analyzing trace with hash 126026793, now seen corresponding path program 1 times [2021-01-06 19:32:51,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:51,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399962499] [2021-01-06 19:32:51,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:51,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399962499] [2021-01-06 19:32:51,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:51,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:51,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264875818] [2021-01-06 19:32:51,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:51,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:51,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:51,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:51,892 INFO L87 Difference]: Start difference. First operand 26872 states and 36391 transitions. Second operand 4 states. [2021-01-06 19:32:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:58,646 INFO L93 Difference]: Finished difference Result 103909 states and 140631 transitions. [2021-01-06 19:32:58,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:58,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:32:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:58,724 INFO L225 Difference]: With dead ends: 103909 [2021-01-06 19:32:58,724 INFO L226 Difference]: Without dead ends: 77115 [2021-01-06 19:32:58,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77115 states. [2021-01-06 19:33:05,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77115 to 75053. [2021-01-06 19:33:05,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75053 states. [2021-01-06 19:33:05,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75053 states to 75053 states and 101038 transitions. [2021-01-06 19:33:05,660 INFO L78 Accepts]: Start accepts. Automaton has 75053 states and 101038 transitions. Word has length 167 [2021-01-06 19:33:05,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:05,660 INFO L481 AbstractCegarLoop]: Abstraction has 75053 states and 101038 transitions. [2021-01-06 19:33:05,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 75053 states and 101038 transitions. [2021-01-06 19:33:05,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:33:05,661 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:05,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:05,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:33:05,662 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:05,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1500502968, now seen corresponding path program 1 times [2021-01-06 19:33:05,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:05,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289467254] [2021-01-06 19:33:05,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:05,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289467254] [2021-01-06 19:33:05,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:05,722 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:33:05,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539668143] [2021-01-06 19:33:05,723 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:05,723 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:05,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:05,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:05,724 INFO L87 Difference]: Start difference. First operand 75053 states and 101038 transitions. Second operand 5 states. [2021-01-06 19:33:16,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:16,034 INFO L93 Difference]: Finished difference Result 193181 states and 261516 transitions. [2021-01-06 19:33:16,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:33:16,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2021-01-06 19:33:16,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:16,170 INFO L225 Difference]: With dead ends: 193181 [2021-01-06 19:33:16,170 INFO L226 Difference]: Without dead ends: 118210 [2021-01-06 19:33:16,217 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:33:16,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118210 states. [2021-01-06 19:33:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118210 to 75734. [2021-01-06 19:33:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75734 states. [2021-01-06 19:33:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75734 states to 75734 states and 101308 transitions. [2021-01-06 19:33:23,617 INFO L78 Accepts]: Start accepts. Automaton has 75734 states and 101308 transitions. Word has length 167 [2021-01-06 19:33:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:23,617 INFO L481 AbstractCegarLoop]: Abstraction has 75734 states and 101308 transitions. [2021-01-06 19:33:23,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 75734 states and 101308 transitions. [2021-01-06 19:33:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:33:23,619 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:23,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:23,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:33:23,619 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:23,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:23,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1799770630, now seen corresponding path program 1 times [2021-01-06 19:33:23,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:23,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462580169] [2021-01-06 19:33:23,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:23,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:23,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462580169] [2021-01-06 19:33:23,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:23,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:33:23,680 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483788631] [2021-01-06 19:33:23,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:23,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:23,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:23,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:23,682 INFO L87 Difference]: Start difference. First operand 75734 states and 101308 transitions. Second operand 5 states. [2021-01-06 19:33:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:40,728 INFO L93 Difference]: Finished difference Result 269409 states and 364026 transitions. [2021-01-06 19:33:40,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:33:40,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2021-01-06 19:33:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:40,940 INFO L225 Difference]: With dead ends: 269409 [2021-01-06 19:33:40,940 INFO L226 Difference]: Without dead ends: 193764 [2021-01-06 19:33:40,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:33:41,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193764 states. [2021-01-06 19:33:49,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193764 to 77648. [2021-01-06 19:33:49,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77648 states. [2021-01-06 19:33:49,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77648 states to 77648 states and 103222 transitions. [2021-01-06 19:33:49,563 INFO L78 Accepts]: Start accepts. Automaton has 77648 states and 103222 transitions. Word has length 167 [2021-01-06 19:33:49,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:49,563 INFO L481 AbstractCegarLoop]: Abstraction has 77648 states and 103222 transitions. [2021-01-06 19:33:49,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 77648 states and 103222 transitions. [2021-01-06 19:33:49,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:33:49,564 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:49,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:33:49,565 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:49,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:49,565 INFO L82 PathProgramCache]: Analyzing trace with hash -928438716, now seen corresponding path program 1 times [2021-01-06 19:33:49,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:49,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019874207] [2021-01-06 19:33:49,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:33:49,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019874207] [2021-01-06 19:33:49,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:49,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:49,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194086269] [2021-01-06 19:33:49,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:49,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:49,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:49,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:49,651 INFO L87 Difference]: Start difference. First operand 77648 states and 103222 transitions. Second operand 4 states. [2021-01-06 19:34:11,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:11,759 INFO L93 Difference]: Finished difference Result 299945 states and 398574 transitions. [2021-01-06 19:34:11,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:34:11,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2021-01-06 19:34:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:12,239 INFO L225 Difference]: With dead ends: 299945 [2021-01-06 19:34:12,239 INFO L226 Difference]: Without dead ends: 222391 [2021-01-06 19:34:12,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:34:12,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222391 states. [2021-01-06 19:34:33,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222391 to 217737. [2021-01-06 19:34:33,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217737 states. [2021-01-06 19:34:34,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217737 states to 217737 states and 287893 transitions. [2021-01-06 19:34:34,656 INFO L78 Accepts]: Start accepts. Automaton has 217737 states and 287893 transitions. Word has length 167 [2021-01-06 19:34:34,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:34,656 INFO L481 AbstractCegarLoop]: Abstraction has 217737 states and 287893 transitions. [2021-01-06 19:34:34,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:34:34,656 INFO L276 IsEmpty]: Start isEmpty. Operand 217737 states and 287893 transitions. [2021-01-06 19:34:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-01-06 19:34:34,659 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:34,659 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:34:34,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:34:34,659 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:34:34,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:34,660 INFO L82 PathProgramCache]: Analyzing trace with hash 88489187, now seen corresponding path program 1 times [2021-01-06 19:34:34,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:34,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865706357] [2021-01-06 19:34:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:34,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:34:34,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865706357] [2021-01-06 19:34:34,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:34:34,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:34:34,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234345217] [2021-01-06 19:34:34,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:34:34,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:34,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:34:34,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:34:34,745 INFO L87 Difference]: Start difference. First operand 217737 states and 287893 transitions. Second operand 5 states.