/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.10.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:27:27,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:27:27,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:27:27,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:27:27,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:27:27,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:27:27,141 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:27:27,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:27:27,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:27:27,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:27:27,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:27:27,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:27:27,165 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:27:27,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:27:27,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:27:27,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:27:27,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:27:27,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:27:27,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:27:27,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:27:27,177 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:27:27,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:27:27,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:27:27,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:27:27,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:27:27,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:27:27,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:27:27,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:27:27,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:27:27,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:27:27,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:27:27,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:27:27,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:27:27,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:27:27,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:27:27,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:27:27,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:27:27,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:27:27,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:27:27,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:27:27,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:27:27,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:27:27,225 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:27:27,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:27:27,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:27:27,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:27:27,227 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:27:27,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:27:27,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:27:27,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:27:27,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:27:27,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:27:27,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:27:27,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:27:27,229 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:27:27,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:27:27,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:27:27,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:27:27,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:27:27,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:27:27,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:27:27,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:27:27,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:27:27,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:27:27,232 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:27:27,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:27:27,232 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:27:27,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:27:27,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:27:27,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:27:27,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:27:27,641 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:27:27,642 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:27:27,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.10.cil-1.c [2021-01-06 19:27:27,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/90b02fda1/423670e645544e6a860dd513bd94c95d/FLAG8ce82e3a6 [2021-01-06 19:27:28,416 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:27:28,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-1.c [2021-01-06 19:27:28,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/90b02fda1/423670e645544e6a860dd513bd94c95d/FLAG8ce82e3a6 [2021-01-06 19:27:28,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/90b02fda1/423670e645544e6a860dd513bd94c95d [2021-01-06 19:27:28,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:27:28,746 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:27:28,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:27:28,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:27:28,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:27:28,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:27:28" (1/1) ... [2021-01-06 19:27:28,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c834a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:28, skipping insertion in model container [2021-01-06 19:27:28,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:27:28" (1/1) ... [2021-01-06 19:27:28,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:27:28,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:27:29,003 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~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[~__retres1~11,] 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~11,] 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~11,] 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~11,] 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[~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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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~12,] [2021-01-06 19:27:29,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:27:29,275 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:27:29,290 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~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[~__retres1~11,] 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~11,] 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~11,] 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~11,] 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[~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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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~12,] [2021-01-06 19:27:29,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:27:29,427 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:27:29,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29 WrapperNode [2021-01-06 19:27:29,428 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:27:29,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:27:29,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:27:29,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:27:29,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (1/1) ... [2021-01-06 19:27:29,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (1/1) ... [2021-01-06 19:27:29,660 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:27:29,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:27:29,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:27:29,661 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:27:29,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (1/1) ... [2021-01-06 19:27:29,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (1/1) ... [2021-01-06 19:27:29,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (1/1) ... [2021-01-06 19:27:29,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (1/1) ... [2021-01-06 19:27:29,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (1/1) ... [2021-01-06 19:27:29,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (1/1) ... [2021-01-06 19:27:29,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (1/1) ... [2021-01-06 19:27:29,789 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:27:29,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:27:29,790 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:27:29,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:27:29,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:27:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:27:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:27:29,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:27:29,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:27:32,861 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:27:32,861 INFO L299 CfgBuilder]: Removed 433 assume(true) statements. [2021-01-06 19:27:32,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:27:32 BoogieIcfgContainer [2021-01-06 19:27:32,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:27:32,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:27:32,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:27:32,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:27:32,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:27:28" (1/3) ... [2021-01-06 19:27:32,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a88bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:27:32, skipping insertion in model container [2021-01-06 19:27:32,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:29" (2/3) ... [2021-01-06 19:27:32,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a88bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:27:32, skipping insertion in model container [2021-01-06 19:27:32,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:27:32" (3/3) ... [2021-01-06 19:27:32,874 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.10.cil-1.c [2021-01-06 19:27:32,881 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:27:32,887 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 19:27:32,906 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-06 19:27:32,940 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:27:32,940 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:27:32,940 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:27:32,940 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:27:32,941 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:27:32,941 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:27:32,941 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:27:32,941 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:27:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states. [2021-01-06 19:27:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:32,989 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:32,991 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] [2021-01-06 19:27:32,991 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:32,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:32,997 INFO L82 PathProgramCache]: Analyzing trace with hash -734508672, now seen corresponding path program 1 times [2021-01-06 19:27:33,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:33,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495718824] [2021-01-06 19:27:33,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:33,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495718824] [2021-01-06 19:27:33,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:33,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:33,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861426944] [2021-01-06 19:27:33,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:33,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:33,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:33,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:33,424 INFO L87 Difference]: Start difference. First operand 1345 states. Second operand 3 states. [2021-01-06 19:27:33,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:33,630 INFO L93 Difference]: Finished difference Result 2685 states and 4073 transitions. [2021-01-06 19:27:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:33,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2021-01-06 19:27:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:33,674 INFO L225 Difference]: With dead ends: 2685 [2021-01-06 19:27:33,675 INFO L226 Difference]: Without dead ends: 1341 [2021-01-06 19:27:33,686 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2021-01-06 19:27:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2021-01-06 19:27:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2021-01-06 19:27:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2007 transitions. [2021-01-06 19:27:33,834 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2007 transitions. Word has length 138 [2021-01-06 19:27:33,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:33,835 INFO L481 AbstractCegarLoop]: Abstraction has 1341 states and 2007 transitions. [2021-01-06 19:27:33,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:33,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2007 transitions. [2021-01-06 19:27:33,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:33,851 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:33,851 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] [2021-01-06 19:27:33,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:27:33,854 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:33,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:33,856 INFO L82 PathProgramCache]: Analyzing trace with hash 882931778, now seen corresponding path program 1 times [2021-01-06 19:27:33,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:33,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636317210] [2021-01-06 19:27:33,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:34,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636317210] [2021-01-06 19:27:34,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:34,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:34,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973225041] [2021-01-06 19:27:34,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:34,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:34,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:34,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:34,072 INFO L87 Difference]: Start difference. First operand 1341 states and 2007 transitions. Second operand 3 states. [2021-01-06 19:27:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:34,144 INFO L93 Difference]: Finished difference Result 2669 states and 3992 transitions. [2021-01-06 19:27:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:34,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2021-01-06 19:27:34,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:34,152 INFO L225 Difference]: With dead ends: 2669 [2021-01-06 19:27:34,153 INFO L226 Difference]: Without dead ends: 1341 [2021-01-06 19:27:34,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2021-01-06 19:27:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2021-01-06 19:27:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2021-01-06 19:27:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2006 transitions. [2021-01-06 19:27:34,210 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2006 transitions. Word has length 138 [2021-01-06 19:27:34,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:34,211 INFO L481 AbstractCegarLoop]: Abstraction has 1341 states and 2006 transitions. [2021-01-06 19:27:34,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2006 transitions. [2021-01-06 19:27:34,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:34,213 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:34,213 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] [2021-01-06 19:27:34,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:27:34,214 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:34,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1312590084, now seen corresponding path program 1 times [2021-01-06 19:27:34,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:34,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381839050] [2021-01-06 19:27:34,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:34,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:27:34,307 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381839050] [2021-01-06 19:27:34,307 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:34,307 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:34,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856920187] [2021-01-06 19:27:34,308 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:34,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:34,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:34,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:34,310 INFO L87 Difference]: Start difference. First operand 1341 states and 2006 transitions. Second operand 3 states. [2021-01-06 19:27:34,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:34,459 INFO L93 Difference]: Finished difference Result 3795 states and 5660 transitions. [2021-01-06 19:27:34,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:34,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2021-01-06 19:27:34,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:34,472 INFO L225 Difference]: With dead ends: 3795 [2021-01-06 19:27:34,472 INFO L226 Difference]: Without dead ends: 2469 [2021-01-06 19:27:34,475 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:34,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2021-01-06 19:27:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2465. [2021-01-06 19:27:34,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3673 transitions. [2021-01-06 19:27:34,567 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3673 transitions. Word has length 138 [2021-01-06 19:27:34,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:34,567 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3673 transitions. [2021-01-06 19:27:34,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:34,567 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3673 transitions. [2021-01-06 19:27:34,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:34,569 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:34,569 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] [2021-01-06 19:27:34,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:27:34,570 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:34,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:34,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2035339326, now seen corresponding path program 1 times [2021-01-06 19:27:34,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:34,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120570694] [2021-01-06 19:27:34,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:34,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:27:34,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120570694] [2021-01-06 19:27:34,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:34,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:34,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613393868] [2021-01-06 19:27:34,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:34,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:34,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:34,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:34,653 INFO L87 Difference]: Start difference. First operand 2465 states and 3673 transitions. Second operand 4 states. [2021-01-06 19:27:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:34,917 INFO L93 Difference]: Finished difference Result 6041 states and 8989 transitions. [2021-01-06 19:27:34,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:34,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:34,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:34,936 INFO L225 Difference]: With dead ends: 6041 [2021-01-06 19:27:34,936 INFO L226 Difference]: Without dead ends: 3592 [2021-01-06 19:27:34,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3592 states. [2021-01-06 19:27:35,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3592 to 2465. [2021-01-06 19:27:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:35,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3670 transitions. [2021-01-06 19:27:35,081 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3670 transitions. Word has length 138 [2021-01-06 19:27:35,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:35,081 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3670 transitions. [2021-01-06 19:27:35,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3670 transitions. [2021-01-06 19:27:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:35,083 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:35,084 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] [2021-01-06 19:27:35,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:27:35,084 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:35,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:35,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1173505724, now seen corresponding path program 1 times [2021-01-06 19:27:35,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:35,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508956196] [2021-01-06 19:27:35,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:35,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508956196] [2021-01-06 19:27:35,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:35,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:35,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768675652] [2021-01-06 19:27:35,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:35,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:35,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:35,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:35,273 INFO L87 Difference]: Start difference. First operand 2465 states and 3670 transitions. Second operand 4 states. [2021-01-06 19:27:35,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:35,547 INFO L93 Difference]: Finished difference Result 6039 states and 8979 transitions. [2021-01-06 19:27:35,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:35,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:35,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:35,567 INFO L225 Difference]: With dead ends: 6039 [2021-01-06 19:27:35,568 INFO L226 Difference]: Without dead ends: 3591 [2021-01-06 19:27:35,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3591 states. [2021-01-06 19:27:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3591 to 2465. [2021-01-06 19:27:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3667 transitions. [2021-01-06 19:27:35,723 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3667 transitions. Word has length 138 [2021-01-06 19:27:35,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:35,724 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3667 transitions. [2021-01-06 19:27:35,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3667 transitions. [2021-01-06 19:27:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:35,726 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:35,726 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] [2021-01-06 19:27:35,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:27:35,726 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1071052674, now seen corresponding path program 1 times [2021-01-06 19:27:35,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:35,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416668366] [2021-01-06 19:27:35,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:35,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416668366] [2021-01-06 19:27:35,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:35,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:35,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711301240] [2021-01-06 19:27:35,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:35,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:35,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:35,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:35,827 INFO L87 Difference]: Start difference. First operand 2465 states and 3667 transitions. Second operand 4 states. [2021-01-06 19:27:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:36,128 INFO L93 Difference]: Finished difference Result 6037 states and 8969 transitions. [2021-01-06 19:27:36,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:36,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:36,145 INFO L225 Difference]: With dead ends: 6037 [2021-01-06 19:27:36,146 INFO L226 Difference]: Without dead ends: 3590 [2021-01-06 19:27:36,150 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2021-01-06 19:27:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 2465. [2021-01-06 19:27:36,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3664 transitions. [2021-01-06 19:27:36,296 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3664 transitions. Word has length 138 [2021-01-06 19:27:36,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:36,297 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3664 transitions. [2021-01-06 19:27:36,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3664 transitions. [2021-01-06 19:27:36,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:36,299 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:36,299 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] [2021-01-06 19:27:36,299 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:27:36,299 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:36,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:36,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1559099780, now seen corresponding path program 1 times [2021-01-06 19:27:36,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:36,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377937310] [2021-01-06 19:27:36,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:36,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377937310] [2021-01-06 19:27:36,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:36,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:36,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051718621] [2021-01-06 19:27:36,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:36,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:36,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:36,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:36,395 INFO L87 Difference]: Start difference. First operand 2465 states and 3664 transitions. Second operand 3 states. [2021-01-06 19:27:36,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:36,585 INFO L93 Difference]: Finished difference Result 4911 states and 7299 transitions. [2021-01-06 19:27:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:36,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2021-01-06 19:27:36,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:36,598 INFO L225 Difference]: With dead ends: 4911 [2021-01-06 19:27:36,598 INFO L226 Difference]: Without dead ends: 2465 [2021-01-06 19:27:36,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2021-01-06 19:27:36,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2465. [2021-01-06 19:27:36,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:36,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3656 transitions. [2021-01-06 19:27:36,806 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3656 transitions. Word has length 138 [2021-01-06 19:27:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:36,806 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3656 transitions. [2021-01-06 19:27:36,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3656 transitions. [2021-01-06 19:27:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:36,808 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:36,808 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] [2021-01-06 19:27:36,808 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:27:36,809 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:36,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:36,809 INFO L82 PathProgramCache]: Analyzing trace with hash 741224192, now seen corresponding path program 1 times [2021-01-06 19:27:36,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:36,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541818383] [2021-01-06 19:27:36,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:36,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541818383] [2021-01-06 19:27:36,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:36,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:36,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387140074] [2021-01-06 19:27:36,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:36,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:36,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:36,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:36,880 INFO L87 Difference]: Start difference. First operand 2465 states and 3656 transitions. Second operand 3 states. [2021-01-06 19:27:37,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:37,056 INFO L93 Difference]: Finished difference Result 4910 states and 7282 transitions. [2021-01-06 19:27:37,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:37,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2021-01-06 19:27:37,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:37,070 INFO L225 Difference]: With dead ends: 4910 [2021-01-06 19:27:37,071 INFO L226 Difference]: Without dead ends: 2465 [2021-01-06 19:27:37,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2021-01-06 19:27:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2465. [2021-01-06 19:27:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3648 transitions. [2021-01-06 19:27:37,211 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3648 transitions. Word has length 138 [2021-01-06 19:27:37,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:37,211 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3648 transitions. [2021-01-06 19:27:37,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3648 transitions. [2021-01-06 19:27:37,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:37,213 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:37,213 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] [2021-01-06 19:27:37,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:27:37,213 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash 160651780, now seen corresponding path program 1 times [2021-01-06 19:27:37,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:37,215 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281755271] [2021-01-06 19:27:37,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:37,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281755271] [2021-01-06 19:27:37,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:37,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:37,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073687869] [2021-01-06 19:27:37,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:37,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:37,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:37,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:37,281 INFO L87 Difference]: Start difference. First operand 2465 states and 3648 transitions. Second operand 4 states. [2021-01-06 19:27:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:37,573 INFO L93 Difference]: Finished difference Result 6029 states and 8913 transitions. [2021-01-06 19:27:37,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:37,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:37,613 INFO L225 Difference]: With dead ends: 6029 [2021-01-06 19:27:37,613 INFO L226 Difference]: Without dead ends: 3586 [2021-01-06 19:27:37,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:37,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2021-01-06 19:27:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 2465. [2021-01-06 19:27:37,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3645 transitions. [2021-01-06 19:27:37,755 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3645 transitions. Word has length 138 [2021-01-06 19:27:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:37,760 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3645 transitions. [2021-01-06 19:27:37,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3645 transitions. [2021-01-06 19:27:37,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:37,762 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:37,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:37,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:27:37,763 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:37,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:37,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1561350906, now seen corresponding path program 1 times [2021-01-06 19:27:37,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:37,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805339377] [2021-01-06 19:27:37,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:37,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805339377] [2021-01-06 19:27:37,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:37,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:37,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100351780] [2021-01-06 19:27:37,831 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:37,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:37,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:37,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:37,834 INFO L87 Difference]: Start difference. First operand 2465 states and 3645 transitions. Second operand 4 states. [2021-01-06 19:27:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:38,091 INFO L93 Difference]: Finished difference Result 6027 states and 8903 transitions. [2021-01-06 19:27:38,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:38,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:38,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:38,103 INFO L225 Difference]: With dead ends: 6027 [2021-01-06 19:27:38,104 INFO L226 Difference]: Without dead ends: 3585 [2021-01-06 19:27:38,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:38,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3585 states. [2021-01-06 19:27:38,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3585 to 2465. [2021-01-06 19:27:38,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:38,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3642 transitions. [2021-01-06 19:27:38,290 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3642 transitions. Word has length 138 [2021-01-06 19:27:38,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:38,290 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3642 transitions. [2021-01-06 19:27:38,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:38,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3642 transitions. [2021-01-06 19:27:38,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:38,292 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:38,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:38,292 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:27:38,293 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:38,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:38,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1893994044, now seen corresponding path program 1 times [2021-01-06 19:27:38,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:38,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944730630] [2021-01-06 19:27:38,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:38,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:38,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944730630] [2021-01-06 19:27:38,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:38,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:38,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820460167] [2021-01-06 19:27:38,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:38,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:38,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:38,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:38,353 INFO L87 Difference]: Start difference. First operand 2465 states and 3642 transitions. Second operand 4 states. [2021-01-06 19:27:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:38,607 INFO L93 Difference]: Finished difference Result 6025 states and 8893 transitions. [2021-01-06 19:27:38,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:38,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:38,616 INFO L225 Difference]: With dead ends: 6025 [2021-01-06 19:27:38,616 INFO L226 Difference]: Without dead ends: 3584 [2021-01-06 19:27:38,621 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2021-01-06 19:27:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 2465. [2021-01-06 19:27:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3639 transitions. [2021-01-06 19:27:38,766 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3639 transitions. Word has length 138 [2021-01-06 19:27:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:38,766 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3639 transitions. [2021-01-06 19:27:38,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3639 transitions. [2021-01-06 19:27:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:38,768 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:38,768 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] [2021-01-06 19:27:38,768 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:27:38,768 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:38,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:38,769 INFO L82 PathProgramCache]: Analyzing trace with hash 34938182, now seen corresponding path program 1 times [2021-01-06 19:27:38,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:38,769 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450678344] [2021-01-06 19:27:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:38,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450678344] [2021-01-06 19:27:38,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:38,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:38,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332971501] [2021-01-06 19:27:38,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:38,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:38,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:38,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:38,829 INFO L87 Difference]: Start difference. First operand 2465 states and 3639 transitions. Second operand 3 states. [2021-01-06 19:27:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:39,002 INFO L93 Difference]: Finished difference Result 4905 states and 7242 transitions. [2021-01-06 19:27:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:39,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2021-01-06 19:27:39,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:39,011 INFO L225 Difference]: With dead ends: 4905 [2021-01-06 19:27:39,011 INFO L226 Difference]: Without dead ends: 2465 [2021-01-06 19:27:39,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2021-01-06 19:27:39,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2465. [2021-01-06 19:27:39,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3631 transitions. [2021-01-06 19:27:39,209 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3631 transitions. Word has length 138 [2021-01-06 19:27:39,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:39,209 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3631 transitions. [2021-01-06 19:27:39,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:39,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3631 transitions. [2021-01-06 19:27:39,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:39,212 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:39,212 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] [2021-01-06 19:27:39,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:27:39,212 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:39,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:39,213 INFO L82 PathProgramCache]: Analyzing trace with hash 2098864066, now seen corresponding path program 1 times [2021-01-06 19:27:39,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:39,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838112980] [2021-01-06 19:27:39,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:39,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838112980] [2021-01-06 19:27:39,289 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:39,289 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:39,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025465894] [2021-01-06 19:27:39,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:39,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:39,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:39,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:39,291 INFO L87 Difference]: Start difference. First operand 2465 states and 3631 transitions. Second operand 4 states. [2021-01-06 19:27:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:39,719 INFO L93 Difference]: Finished difference Result 5944 states and 8752 transitions. [2021-01-06 19:27:39,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:39,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:39,728 INFO L225 Difference]: With dead ends: 5944 [2021-01-06 19:27:39,728 INFO L226 Difference]: Without dead ends: 3505 [2021-01-06 19:27:39,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2021-01-06 19:27:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 2465. [2021-01-06 19:27:39,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:39,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3628 transitions. [2021-01-06 19:27:39,927 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3628 transitions. Word has length 138 [2021-01-06 19:27:39,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:39,928 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3628 transitions. [2021-01-06 19:27:39,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:39,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3628 transitions. [2021-01-06 19:27:39,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:39,929 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:39,930 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] [2021-01-06 19:27:39,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:27:39,930 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:39,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:39,931 INFO L82 PathProgramCache]: Analyzing trace with hash -468958268, now seen corresponding path program 1 times [2021-01-06 19:27:39,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:39,931 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882284426] [2021-01-06 19:27:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:39,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882284426] [2021-01-06 19:27:39,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:39,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:39,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196065304] [2021-01-06 19:27:39,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:39,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:39,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:39,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:39,986 INFO L87 Difference]: Start difference. First operand 2465 states and 3628 transitions. Second operand 4 states. [2021-01-06 19:27:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:40,335 INFO L93 Difference]: Finished difference Result 5942 states and 8742 transitions. [2021-01-06 19:27:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:40,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:40,343 INFO L225 Difference]: With dead ends: 5942 [2021-01-06 19:27:40,343 INFO L226 Difference]: Without dead ends: 3504 [2021-01-06 19:27:40,348 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3504 states. [2021-01-06 19:27:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3504 to 2465. [2021-01-06 19:27:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3625 transitions. [2021-01-06 19:27:40,567 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3625 transitions. Word has length 138 [2021-01-06 19:27:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:40,568 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3625 transitions. [2021-01-06 19:27:40,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3625 transitions. [2021-01-06 19:27:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:40,569 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:40,570 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] [2021-01-06 19:27:40,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:27:40,570 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:40,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:40,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2398082, now seen corresponding path program 1 times [2021-01-06 19:27:40,571 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:40,571 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927816537] [2021-01-06 19:27:40,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:40,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927816537] [2021-01-06 19:27:40,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:40,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:40,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522551184] [2021-01-06 19:27:40,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:40,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:40,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:40,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:40,621 INFO L87 Difference]: Start difference. First operand 2465 states and 3625 transitions. Second operand 3 states. [2021-01-06 19:27:40,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:40,821 INFO L93 Difference]: Finished difference Result 4902 states and 7211 transitions. [2021-01-06 19:27:40,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:40,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2021-01-06 19:27:40,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:40,827 INFO L225 Difference]: With dead ends: 4902 [2021-01-06 19:27:40,827 INFO L226 Difference]: Without dead ends: 2465 [2021-01-06 19:27:40,831 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2021-01-06 19:27:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2465. [2021-01-06 19:27:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3593 transitions. [2021-01-06 19:27:40,987 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3593 transitions. Word has length 138 [2021-01-06 19:27:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:40,988 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3593 transitions. [2021-01-06 19:27:40,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3593 transitions. [2021-01-06 19:27:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:40,989 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:40,990 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] [2021-01-06 19:27:40,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:27:40,990 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash 844564102, now seen corresponding path program 1 times [2021-01-06 19:27:40,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:40,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404839727] [2021-01-06 19:27:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:41,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404839727] [2021-01-06 19:27:41,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:41,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:41,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768709374] [2021-01-06 19:27:41,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:41,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:41,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:41,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:41,043 INFO L87 Difference]: Start difference. First operand 2465 states and 3593 transitions. Second operand 4 states. [2021-01-06 19:27:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:41,427 INFO L93 Difference]: Finished difference Result 5936 states and 8649 transitions. [2021-01-06 19:27:41,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:41,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:41,435 INFO L225 Difference]: With dead ends: 5936 [2021-01-06 19:27:41,435 INFO L226 Difference]: Without dead ends: 3501 [2021-01-06 19:27:41,439 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:41,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2021-01-06 19:27:41,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 2465. [2021-01-06 19:27:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3590 transitions. [2021-01-06 19:27:41,610 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3590 transitions. Word has length 138 [2021-01-06 19:27:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:41,611 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3590 transitions. [2021-01-06 19:27:41,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3590 transitions. [2021-01-06 19:27:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:41,612 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:41,613 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] [2021-01-06 19:27:41,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:27:41,613 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:41,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:41,613 INFO L82 PathProgramCache]: Analyzing trace with hash -194020472, now seen corresponding path program 1 times [2021-01-06 19:27:41,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:41,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022474701] [2021-01-06 19:27:41,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:41,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022474701] [2021-01-06 19:27:41,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:41,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:41,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176557772] [2021-01-06 19:27:41,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:41,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:41,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:41,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:41,684 INFO L87 Difference]: Start difference. First operand 2465 states and 3590 transitions. Second operand 4 states. [2021-01-06 19:27:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:42,120 INFO L93 Difference]: Finished difference Result 5934 states and 8639 transitions. [2021-01-06 19:27:42,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:42,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:42,128 INFO L225 Difference]: With dead ends: 5934 [2021-01-06 19:27:42,128 INFO L226 Difference]: Without dead ends: 3500 [2021-01-06 19:27:42,132 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3500 states. [2021-01-06 19:27:42,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3500 to 2465. [2021-01-06 19:27:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3587 transitions. [2021-01-06 19:27:42,306 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3587 transitions. Word has length 138 [2021-01-06 19:27:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:42,306 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3587 transitions. [2021-01-06 19:27:42,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:42,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3587 transitions. [2021-01-06 19:27:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:42,308 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:42,308 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] [2021-01-06 19:27:42,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:27:42,309 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:42,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:42,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2127781446, now seen corresponding path program 1 times [2021-01-06 19:27:42,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:42,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640566677] [2021-01-06 19:27:42,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:42,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640566677] [2021-01-06 19:27:42,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:42,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:42,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899545742] [2021-01-06 19:27:42,361 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:42,361 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:42,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:42,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:42,362 INFO L87 Difference]: Start difference. First operand 2465 states and 3587 transitions. Second operand 4 states. [2021-01-06 19:27:42,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:42,770 INFO L93 Difference]: Finished difference Result 5932 states and 8629 transitions. [2021-01-06 19:27:42,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:42,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:42,778 INFO L225 Difference]: With dead ends: 5932 [2021-01-06 19:27:42,778 INFO L226 Difference]: Without dead ends: 3499 [2021-01-06 19:27:42,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:42,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2021-01-06 19:27:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 2465. [2021-01-06 19:27:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:43,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3584 transitions. [2021-01-06 19:27:43,049 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3584 transitions. Word has length 138 [2021-01-06 19:27:43,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:43,049 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3584 transitions. [2021-01-06 19:27:43,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:43,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3584 transitions. [2021-01-06 19:27:43,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:43,051 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:43,051 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] [2021-01-06 19:27:43,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:27:43,052 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:43,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:43,052 INFO L82 PathProgramCache]: Analyzing trace with hash -14079032, now seen corresponding path program 1 times [2021-01-06 19:27:43,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:43,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146651944] [2021-01-06 19:27:43,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:43,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:43,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146651944] [2021-01-06 19:27:43,119 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:43,119 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:43,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135266077] [2021-01-06 19:27:43,120 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:43,120 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:43,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:43,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:43,121 INFO L87 Difference]: Start difference. First operand 2465 states and 3584 transitions. Second operand 4 states. [2021-01-06 19:27:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:43,572 INFO L93 Difference]: Finished difference Result 5930 states and 8619 transitions. [2021-01-06 19:27:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:43,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:43,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:43,580 INFO L225 Difference]: With dead ends: 5930 [2021-01-06 19:27:43,580 INFO L226 Difference]: Without dead ends: 3498 [2021-01-06 19:27:43,584 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2021-01-06 19:27:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 2465. [2021-01-06 19:27:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3581 transitions. [2021-01-06 19:27:43,779 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3581 transitions. Word has length 138 [2021-01-06 19:27:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:43,779 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3581 transitions. [2021-01-06 19:27:43,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:43,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3581 transitions. [2021-01-06 19:27:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:43,781 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:43,781 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:43,781 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:27:43,781 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:43,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:43,782 INFO L82 PathProgramCache]: Analyzing trace with hash -637360634, now seen corresponding path program 1 times [2021-01-06 19:27:43,782 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:43,782 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814755518] [2021-01-06 19:27:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:43,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814755518] [2021-01-06 19:27:43,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:43,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:43,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147609236] [2021-01-06 19:27:43,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:43,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:43,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:43,841 INFO L87 Difference]: Start difference. First operand 2465 states and 3581 transitions. Second operand 4 states. [2021-01-06 19:27:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:44,268 INFO L93 Difference]: Finished difference Result 5928 states and 8609 transitions. [2021-01-06 19:27:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:44,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:44,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:44,277 INFO L225 Difference]: With dead ends: 5928 [2021-01-06 19:27:44,278 INFO L226 Difference]: Without dead ends: 3497 [2021-01-06 19:27:44,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:44,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2021-01-06 19:27:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 2465. [2021-01-06 19:27:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3578 transitions. [2021-01-06 19:27:44,475 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3578 transitions. Word has length 138 [2021-01-06 19:27:44,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:44,475 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3578 transitions. [2021-01-06 19:27:44,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3578 transitions. [2021-01-06 19:27:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:44,477 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:44,477 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] [2021-01-06 19:27:44,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:27:44,477 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:44,478 INFO L82 PathProgramCache]: Analyzing trace with hash -518919160, now seen corresponding path program 1 times [2021-01-06 19:27:44,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:44,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494542426] [2021-01-06 19:27:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:44,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494542426] [2021-01-06 19:27:44,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:44,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:44,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475303744] [2021-01-06 19:27:44,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:44,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:44,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:44,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:44,539 INFO L87 Difference]: Start difference. First operand 2465 states and 3578 transitions. Second operand 4 states. [2021-01-06 19:27:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:44,903 INFO L93 Difference]: Finished difference Result 5926 states and 8599 transitions. [2021-01-06 19:27:44,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:44,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:44,911 INFO L225 Difference]: With dead ends: 5926 [2021-01-06 19:27:44,911 INFO L226 Difference]: Without dead ends: 3496 [2021-01-06 19:27:44,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2021-01-06 19:27:45,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 2465. [2021-01-06 19:27:45,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3575 transitions. [2021-01-06 19:27:45,141 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3575 transitions. Word has length 138 [2021-01-06 19:27:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:45,141 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3575 transitions. [2021-01-06 19:27:45,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3575 transitions. [2021-01-06 19:27:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:45,142 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:45,142 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] [2021-01-06 19:27:45,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:27:45,143 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash 870374854, now seen corresponding path program 1 times [2021-01-06 19:27:45,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:45,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158272549] [2021-01-06 19:27:45,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:45,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158272549] [2021-01-06 19:27:45,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:45,194 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:45,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206399711] [2021-01-06 19:27:45,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:45,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:45,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:45,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:45,196 INFO L87 Difference]: Start difference. First operand 2465 states and 3575 transitions. Second operand 4 states. [2021-01-06 19:27:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:45,624 INFO L93 Difference]: Finished difference Result 5924 states and 8589 transitions. [2021-01-06 19:27:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:45,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2021-01-06 19:27:45,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:45,632 INFO L225 Difference]: With dead ends: 5924 [2021-01-06 19:27:45,632 INFO L226 Difference]: Without dead ends: 3495 [2021-01-06 19:27:45,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2021-01-06 19:27:45,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 2465. [2021-01-06 19:27:45,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2465 states. [2021-01-06 19:27:45,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2465 states to 2465 states and 3572 transitions. [2021-01-06 19:27:45,855 INFO L78 Accepts]: Start accepts. Automaton has 2465 states and 3572 transitions. Word has length 138 [2021-01-06 19:27:45,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:45,856 INFO L481 AbstractCegarLoop]: Abstraction has 2465 states and 3572 transitions. [2021-01-06 19:27:45,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:45,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3572 transitions. [2021-01-06 19:27:45,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-01-06 19:27:45,857 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:45,857 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] [2021-01-06 19:27:45,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:27:45,857 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:45,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:45,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1163019192, now seen corresponding path program 1 times [2021-01-06 19:27:45,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:45,858 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637725851] [2021-01-06 19:27:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:45,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637725851] [2021-01-06 19:27:45,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:45,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:45,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594121304] [2021-01-06 19:27:45,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:45,960 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:45,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:45,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:45,960 INFO L87 Difference]: Start difference. First operand 2465 states and 3572 transitions. Second operand 3 states. [2021-01-06 19:27:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:46,372 INFO L93 Difference]: Finished difference Result 7178 states and 10389 transitions. [2021-01-06 19:27:46,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:46,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2021-01-06 19:27:46,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:46,390 INFO L225 Difference]: With dead ends: 7178 [2021-01-06 19:27:46,390 INFO L226 Difference]: Without dead ends: 4751 [2021-01-06 19:27:46,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4751 states. [2021-01-06 19:27:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4751 to 4601. [2021-01-06 19:27:46,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4601 states. [2021-01-06 19:27:46,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 6629 transitions. [2021-01-06 19:27:46,791 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 6629 transitions. Word has length 138 [2021-01-06 19:27:46,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:46,791 INFO L481 AbstractCegarLoop]: Abstraction has 4601 states and 6629 transitions. [2021-01-06 19:27:46,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:46,792 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 6629 transitions. [2021-01-06 19:27:46,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:27:46,833 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:46,834 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:46,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:27:46,834 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:46,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:46,835 INFO L82 PathProgramCache]: Analyzing trace with hash 92158667, now seen corresponding path program 1 times [2021-01-06 19:27:46,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:46,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140451689] [2021-01-06 19:27:46,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:27:46,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140451689] [2021-01-06 19:27:46,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:46,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:27:46,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319082786] [2021-01-06 19:27:46,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:27:46,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:27:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:46,970 INFO L87 Difference]: Start difference. First operand 4601 states and 6629 transitions. Second operand 5 states. [2021-01-06 19:27:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:48,100 INFO L93 Difference]: Finished difference Result 13603 states and 19616 transitions. [2021-01-06 19:27:48,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:27:48,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2021-01-06 19:27:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:48,121 INFO L225 Difference]: With dead ends: 13603 [2021-01-06 19:27:48,121 INFO L226 Difference]: Without dead ends: 9044 [2021-01-06 19:27:48,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:27:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9044 states. [2021-01-06 19:27:48,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9044 to 4676. [2021-01-06 19:27:48,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4676 states. [2021-01-06 19:27:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4676 states to 4676 states and 6680 transitions. [2021-01-06 19:27:48,606 INFO L78 Accepts]: Start accepts. Automaton has 4676 states and 6680 transitions. Word has length 225 [2021-01-06 19:27:48,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:48,606 INFO L481 AbstractCegarLoop]: Abstraction has 4676 states and 6680 transitions. [2021-01-06 19:27:48,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:27:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 4676 states and 6680 transitions. [2021-01-06 19:27:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:27:48,610 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:48,611 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:48,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:27:48,611 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:48,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:48,612 INFO L82 PathProgramCache]: Analyzing trace with hash -263209657, now seen corresponding path program 1 times [2021-01-06 19:27:48,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:48,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710160333] [2021-01-06 19:27:48,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:48,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:27:48,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710160333] [2021-01-06 19:27:48,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:48,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:48,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790193435] [2021-01-06 19:27:48,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:48,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:48,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:48,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:48,694 INFO L87 Difference]: Start difference. First operand 4676 states and 6680 transitions. Second operand 4 states. [2021-01-06 19:27:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:49,705 INFO L93 Difference]: Finished difference Result 15871 states and 22630 transitions. [2021-01-06 19:27:49,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:49,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2021-01-06 19:27:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:49,729 INFO L225 Difference]: With dead ends: 15871 [2021-01-06 19:27:49,730 INFO L226 Difference]: Without dead ends: 11239 [2021-01-06 19:27:49,739 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11239 states. [2021-01-06 19:27:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11239 to 8845. [2021-01-06 19:27:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8845 states. [2021-01-06 19:27:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8845 states to 8845 states and 12578 transitions. [2021-01-06 19:27:50,568 INFO L78 Accepts]: Start accepts. Automaton has 8845 states and 12578 transitions. Word has length 225 [2021-01-06 19:27:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:50,569 INFO L481 AbstractCegarLoop]: Abstraction has 8845 states and 12578 transitions. [2021-01-06 19:27:50,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 8845 states and 12578 transitions. [2021-01-06 19:27:50,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:27:50,575 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:50,575 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:50,575 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:27:50,575 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:50,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:50,576 INFO L82 PathProgramCache]: Analyzing trace with hash 291204262, now seen corresponding path program 1 times [2021-01-06 19:27:50,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:50,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065250957] [2021-01-06 19:27:50,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:50,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:27:50,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065250957] [2021-01-06 19:27:50,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:50,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:27:50,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155721612] [2021-01-06 19:27:50,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:27:50,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:50,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:27:50,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:50,667 INFO L87 Difference]: Start difference. First operand 8845 states and 12578 transitions. Second operand 5 states. [2021-01-06 19:27:52,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:52,342 INFO L93 Difference]: Finished difference Result 25904 states and 36937 transitions. [2021-01-06 19:27:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:27:52,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2021-01-06 19:27:52,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:52,369 INFO L225 Difference]: With dead ends: 25904 [2021-01-06 19:27:52,369 INFO L226 Difference]: Without dead ends: 17107 [2021-01-06 19:27:52,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:27:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17107 states. [2021-01-06 19:27:53,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17107 to 8989. [2021-01-06 19:27:53,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8989 states. [2021-01-06 19:27:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8989 states to 8989 states and 12677 transitions. [2021-01-06 19:27:53,428 INFO L78 Accepts]: Start accepts. Automaton has 8989 states and 12677 transitions. Word has length 225 [2021-01-06 19:27:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:53,428 INFO L481 AbstractCegarLoop]: Abstraction has 8989 states and 12677 transitions. [2021-01-06 19:27:53,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:27:53,429 INFO L276 IsEmpty]: Start isEmpty. Operand 8989 states and 12677 transitions. [2021-01-06 19:27:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:27:53,435 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:53,435 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:53,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:27:53,436 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:53,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash -835748830, now seen corresponding path program 1 times [2021-01-06 19:27:53,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:53,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624297345] [2021-01-06 19:27:53,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:27:53,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624297345] [2021-01-06 19:27:53,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:53,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:53,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015255516] [2021-01-06 19:27:53,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:53,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:53,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:53,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:53,530 INFO L87 Difference]: Start difference. First operand 8989 states and 12677 transitions. Second operand 4 states. [2021-01-06 19:27:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:55,171 INFO L93 Difference]: Finished difference Result 30596 states and 43082 transitions. [2021-01-06 19:27:55,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:55,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2021-01-06 19:27:55,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:55,193 INFO L225 Difference]: With dead ends: 30596 [2021-01-06 19:27:55,197 INFO L226 Difference]: Without dead ends: 21664 [2021-01-06 19:27:55,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:55,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21664 states. [2021-01-06 19:27:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21664 to 17100. [2021-01-06 19:27:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17100 states. [2021-01-06 19:27:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17100 states to 17100 states and 24014 transitions. [2021-01-06 19:27:56,973 INFO L78 Accepts]: Start accepts. Automaton has 17100 states and 24014 transitions. Word has length 225 [2021-01-06 19:27:56,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:56,973 INFO L481 AbstractCegarLoop]: Abstraction has 17100 states and 24014 transitions. [2021-01-06 19:27:56,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:56,973 INFO L276 IsEmpty]: Start isEmpty. Operand 17100 states and 24014 transitions. [2021-01-06 19:27:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:27:56,984 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:56,984 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:56,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:27:56,985 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1531444735, now seen corresponding path program 1 times [2021-01-06 19:27:56,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:56,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517394840] [2021-01-06 19:27:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:57,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:27:57,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517394840] [2021-01-06 19:27:57,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:57,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:27:57,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329632561] [2021-01-06 19:27:57,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:27:57,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:57,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:27:57,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:57,096 INFO L87 Difference]: Start difference. First operand 17100 states and 24014 transitions. Second operand 5 states. [2021-01-06 19:27:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:59,822 INFO L93 Difference]: Finished difference Result 48887 states and 69033 transitions. [2021-01-06 19:27:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:27:59,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2021-01-06 19:27:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:59,856 INFO L225 Difference]: With dead ends: 48887 [2021-01-06 19:27:59,856 INFO L226 Difference]: Without dead ends: 31848 [2021-01-06 19:27:59,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:27:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31848 states. [2021-01-06 19:28:01,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31848 to 17376. [2021-01-06 19:28:01,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17376 states. [2021-01-06 19:28:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17376 states to 17376 states and 24205 transitions. [2021-01-06 19:28:01,409 INFO L78 Accepts]: Start accepts. Automaton has 17376 states and 24205 transitions. Word has length 225 [2021-01-06 19:28:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:01,409 INFO L481 AbstractCegarLoop]: Abstraction has 17376 states and 24205 transitions. [2021-01-06 19:28:01,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 17376 states and 24205 transitions. [2021-01-06 19:28:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:28:01,418 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:01,419 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:01,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:28:01,419 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:01,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1754633347, now seen corresponding path program 1 times [2021-01-06 19:28:01,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:01,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203415705] [2021-01-06 19:28:01,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:01,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203415705] [2021-01-06 19:28:01,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:01,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:01,502 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044884949] [2021-01-06 19:28:01,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:01,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:01,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:01,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:01,503 INFO L87 Difference]: Start difference. First operand 17376 states and 24205 transitions. Second operand 5 states. [2021-01-06 19:28:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:05,283 INFO L93 Difference]: Finished difference Result 62207 states and 87408 transitions. [2021-01-06 19:28:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:05,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2021-01-06 19:28:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:05,325 INFO L225 Difference]: With dead ends: 62207 [2021-01-06 19:28:05,325 INFO L226 Difference]: Without dead ends: 44899 [2021-01-06 19:28:05,345 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:28:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44899 states. [2021-01-06 19:28:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44899 to 17907. [2021-01-06 19:28:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17907 states. [2021-01-06 19:28:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17907 states to 17907 states and 24736 transitions. [2021-01-06 19:28:07,083 INFO L78 Accepts]: Start accepts. Automaton has 17907 states and 24736 transitions. Word has length 225 [2021-01-06 19:28:07,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:07,084 INFO L481 AbstractCegarLoop]: Abstraction has 17907 states and 24736 transitions. [2021-01-06 19:28:07,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 17907 states and 24736 transitions. [2021-01-06 19:28:07,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:28:07,091 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:07,091 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:07,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:28:07,091 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:07,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:07,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1754336059, now seen corresponding path program 1 times [2021-01-06 19:28:07,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:07,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942140289] [2021-01-06 19:28:07,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:07,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942140289] [2021-01-06 19:28:07,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:07,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:07,219 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838020596] [2021-01-06 19:28:07,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:07,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:07,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:07,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:07,221 INFO L87 Difference]: Start difference. First operand 17907 states and 24736 transitions. Second operand 4 states. [2021-01-06 19:28:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:11,205 INFO L93 Difference]: Finished difference Result 60900 states and 84006 transitions. [2021-01-06 19:28:11,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:11,205 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2021-01-06 19:28:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:11,245 INFO L225 Difference]: With dead ends: 60900 [2021-01-06 19:28:11,245 INFO L226 Difference]: Without dead ends: 43066 [2021-01-06 19:28:11,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43066 states. [2021-01-06 19:28:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43066 to 34138. [2021-01-06 19:28:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34138 states. [2021-01-06 19:28:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34138 states to 34138 states and 46969 transitions. [2021-01-06 19:28:14,377 INFO L78 Accepts]: Start accepts. Automaton has 34138 states and 46969 transitions. Word has length 225 [2021-01-06 19:28:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:14,377 INFO L481 AbstractCegarLoop]: Abstraction has 34138 states and 46969 transitions. [2021-01-06 19:28:14,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 34138 states and 46969 transitions. [2021-01-06 19:28:14,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:28:14,388 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:14,389 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:14,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:28:14,389 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:14,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:14,390 INFO L82 PathProgramCache]: Analyzing trace with hash 406323065, now seen corresponding path program 1 times [2021-01-06 19:28:14,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:14,390 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288709093] [2021-01-06 19:28:14,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:14,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288709093] [2021-01-06 19:28:14,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:14,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:14,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127869299] [2021-01-06 19:28:14,472 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:14,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:14,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:14,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:14,472 INFO L87 Difference]: Start difference. First operand 34138 states and 46969 transitions. Second operand 5 states. [2021-01-06 19:28:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:20,095 INFO L93 Difference]: Finished difference Result 94887 states and 131492 transitions. [2021-01-06 19:28:20,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:20,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2021-01-06 19:28:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:20,153 INFO L225 Difference]: With dead ends: 94887 [2021-01-06 19:28:20,153 INFO L226 Difference]: Without dead ends: 60826 [2021-01-06 19:28:20,181 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:28:20,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60826 states. [2021-01-06 19:28:23,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60826 to 34666. [2021-01-06 19:28:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34666 states. [2021-01-06 19:28:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34666 states to 34666 states and 47336 transitions. [2021-01-06 19:28:23,939 INFO L78 Accepts]: Start accepts. Automaton has 34666 states and 47336 transitions. Word has length 225 [2021-01-06 19:28:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:23,939 INFO L481 AbstractCegarLoop]: Abstraction has 34666 states and 47336 transitions. [2021-01-06 19:28:23,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 34666 states and 47336 transitions. [2021-01-06 19:28:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:28:23,954 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:23,954 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:23,954 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:28:23,955 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:23,955 INFO L82 PathProgramCache]: Analyzing trace with hash 671073013, now seen corresponding path program 1 times [2021-01-06 19:28:23,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:23,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453586574] [2021-01-06 19:28:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:24,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453586574] [2021-01-06 19:28:24,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:24,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:24,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799931760] [2021-01-06 19:28:24,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:24,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:24,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:24,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:24,078 INFO L87 Difference]: Start difference. First operand 34666 states and 47336 transitions. Second operand 5 states. [2021-01-06 19:28:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:31,924 INFO L93 Difference]: Finished difference Result 118783 states and 163919 transitions. [2021-01-06 19:28:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:31,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2021-01-06 19:28:31,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:32,004 INFO L225 Difference]: With dead ends: 118783 [2021-01-06 19:28:32,004 INFO L226 Difference]: Without dead ends: 84201 [2021-01-06 19:28:32,027 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:28:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84201 states. [2021-01-06 19:28:36,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84201 to 35677. [2021-01-06 19:28:36,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35677 states. [2021-01-06 19:28:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35677 states to 35677 states and 48347 transitions. [2021-01-06 19:28:36,166 INFO L78 Accepts]: Start accepts. Automaton has 35677 states and 48347 transitions. Word has length 225 [2021-01-06 19:28:36,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:36,166 INFO L481 AbstractCegarLoop]: Abstraction has 35677 states and 48347 transitions. [2021-01-06 19:28:36,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:36,166 INFO L276 IsEmpty]: Start isEmpty. Operand 35677 states and 48347 transitions. [2021-01-06 19:28:36,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:28:36,178 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:36,178 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:36,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:28:36,179 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash 406425523, now seen corresponding path program 1 times [2021-01-06 19:28:36,179 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:36,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400805243] [2021-01-06 19:28:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:36,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400805243] [2021-01-06 19:28:36,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:36,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:36,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058260844] [2021-01-06 19:28:36,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:36,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:36,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:36,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:36,274 INFO L87 Difference]: Start difference. First operand 35677 states and 48347 transitions. Second operand 4 states. [2021-01-06 19:28:44,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:44,927 INFO L93 Difference]: Finished difference Result 121012 states and 163765 transitions. [2021-01-06 19:28:44,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:44,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2021-01-06 19:28:44,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:45,011 INFO L225 Difference]: With dead ends: 121012 [2021-01-06 19:28:45,011 INFO L226 Difference]: Without dead ends: 85424 [2021-01-06 19:28:45,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:45,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85424 states. [2021-01-06 19:28:52,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85424 to 68028. [2021-01-06 19:28:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68028 states. [2021-01-06 19:28:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68028 states to 68028 states and 91848 transitions. [2021-01-06 19:28:52,574 INFO L78 Accepts]: Start accepts. Automaton has 68028 states and 91848 transitions. Word has length 225 [2021-01-06 19:28:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:52,574 INFO L481 AbstractCegarLoop]: Abstraction has 68028 states and 91848 transitions. [2021-01-06 19:28:52,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 68028 states and 91848 transitions. [2021-01-06 19:28:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:28:52,597 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:52,598 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:52,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:28:52,598 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:52,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:52,598 INFO L82 PathProgramCache]: Analyzing trace with hash 158232817, now seen corresponding path program 1 times [2021-01-06 19:28:52,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:52,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605249003] [2021-01-06 19:28:52,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:52,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605249003] [2021-01-06 19:28:52,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:52,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:52,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535176251] [2021-01-06 19:28:52,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:52,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:52,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:52,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:52,685 INFO L87 Difference]: Start difference. First operand 68028 states and 91848 transitions. Second operand 5 states. [2021-01-06 19:29:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:04,820 INFO L93 Difference]: Finished difference Result 184051 states and 250419 transitions. [2021-01-06 19:29:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:04,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2021-01-06 19:29:04,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:04,949 INFO L225 Difference]: With dead ends: 184051 [2021-01-06 19:29:04,949 INFO L226 Difference]: Without dead ends: 116116 [2021-01-06 19:29:05,185 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:29:05,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116116 states. [2021-01-06 19:29:13,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116116 to 69036. [2021-01-06 19:29:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69036 states. [2021-01-06 19:29:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69036 states to 69036 states and 92551 transitions. [2021-01-06 19:29:13,449 INFO L78 Accepts]: Start accepts. Automaton has 69036 states and 92551 transitions. Word has length 225 [2021-01-06 19:29:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:13,450 INFO L481 AbstractCegarLoop]: Abstraction has 69036 states and 92551 transitions. [2021-01-06 19:29:13,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 69036 states and 92551 transitions. [2021-01-06 19:29:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:29:13,470 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:13,471 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:13,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:29:13,471 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:13,472 INFO L82 PathProgramCache]: Analyzing trace with hash -134050195, now seen corresponding path program 1 times [2021-01-06 19:29:13,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:13,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820798185] [2021-01-06 19:29:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:13,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820798185] [2021-01-06 19:29:13,555 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:13,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:13,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224017955] [2021-01-06 19:29:13,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:13,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:13,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:13,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:13,556 INFO L87 Difference]: Start difference. First operand 69036 states and 92551 transitions. Second operand 5 states. [2021-01-06 19:29:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:30,672 INFO L93 Difference]: Finished difference Result 226855 states and 307458 transitions. [2021-01-06 19:29:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:30,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2021-01-06 19:29:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:31,030 INFO L225 Difference]: With dead ends: 226855 [2021-01-06 19:29:31,030 INFO L226 Difference]: Without dead ends: 157919 [2021-01-06 19:29:31,088 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:29:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157919 states. [2021-01-06 19:29:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157919 to 70959. [2021-01-06 19:29:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70959 states. [2021-01-06 19:29:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70959 states to 70959 states and 94474 transitions. [2021-01-06 19:29:40,077 INFO L78 Accepts]: Start accepts. Automaton has 70959 states and 94474 transitions. Word has length 225 [2021-01-06 19:29:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:40,077 INFO L481 AbstractCegarLoop]: Abstraction has 70959 states and 94474 transitions. [2021-01-06 19:29:40,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 70959 states and 94474 transitions. [2021-01-06 19:29:40,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2021-01-06 19:29:40,094 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:40,095 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:40,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:29:40,095 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:40,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:40,095 INFO L82 PathProgramCache]: Analyzing trace with hash -110528279, now seen corresponding path program 1 times [2021-01-06 19:29:40,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:40,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219430516] [2021-01-06 19:29:40,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:40,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219430516] [2021-01-06 19:29:40,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:40,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:40,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595584176] [2021-01-06 19:29:40,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:40,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:40,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:40,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:40,191 INFO L87 Difference]: Start difference. First operand 70959 states and 94474 transitions. Second operand 4 states. [2021-01-06 19:30:00,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:00,097 INFO L93 Difference]: Finished difference Result 239784 states and 318804 transitions. [2021-01-06 19:30:00,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:00,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2021-01-06 19:30:00,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:00,298 INFO L225 Difference]: With dead ends: 239784 [2021-01-06 19:30:00,299 INFO L226 Difference]: Without dead ends: 168930 [2021-01-06 19:30:00,370 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:30:00,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168930 states.