/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.11.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:27:42,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:27:42,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:27:42,438 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:27:42,439 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:27:42,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:27:42,442 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:27:42,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:27:42,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:27:42,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:27:42,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:27:42,451 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:27:42,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:27:42,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:27:42,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:27:42,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:27:42,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:27:42,457 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:27:42,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:27:42,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:27:42,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:27:42,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:27:42,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:27:42,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:27:42,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:27:42,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:27:42,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:27:42,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:27:42,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:27:42,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:27:42,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:27:42,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:27:42,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:27:42,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:27:42,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:27:42,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:27:42,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:27:42,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:27:42,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:27:42,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:27:42,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:27:42,491 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:42,523 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:27:42,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:27:42,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:27:42,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:27:42,526 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:27:42,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:27:42,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:27:42,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:27:42,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:27:42,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:27:42,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:27:42,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:27:42,528 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:27:42,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:27:42,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:27:42,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:27:42,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:27:42,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:27:42,530 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:27:42,530 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:27:42,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:27:42,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:27:42,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:27:42,531 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:27:42,531 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:27:42,532 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:42,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:27:42,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:27:42,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:27:42,934 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:27:42,936 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:27:42,937 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.11.cil-1.c [2021-01-06 19:27:43,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/464f8ee82/6ecf8c6e10e745c68459cb0ec92a6e98/FLAGe61abe7aa [2021-01-06 19:27:43,719 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:27:43,719 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.11.cil-1.c [2021-01-06 19:27:43,745 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/464f8ee82/6ecf8c6e10e745c68459cb0ec92a6e98/FLAGe61abe7aa [2021-01-06 19:27:44,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/464f8ee82/6ecf8c6e10e745c68459cb0ec92a6e98 [2021-01-06 19:27:44,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:27:44,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:27:44,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:27:44,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:27:44,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:27:44,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:27:44" (1/1) ... [2021-01-06 19:27:44,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341a8c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:44, skipping insertion in model container [2021-01-06 19:27:44,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:27:44" (1/1) ... [2021-01-06 19:27:44,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:27:44,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:27:44,265 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.11.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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~13,] [2021-01-06 19:27:44,503 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:27:44,515 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:27:44,529 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.11.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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~13,] [2021-01-06 19:27:44,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:27:44,679 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:27:44,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:44 WrapperNode [2021-01-06 19:27:44,680 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:27:44,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:27:44,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:27:44,682 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:27:44,691 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:44" (1/1) ... [2021-01-06 19:27:44,731 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:44" (1/1) ... [2021-01-06 19:27:44,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:27:44,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:27:44,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:27:44,858 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:27:44,868 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:44" (1/1) ... [2021-01-06 19:27:44,869 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:44" (1/1) ... [2021-01-06 19:27:44,879 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:44" (1/1) ... [2021-01-06 19:27:44,880 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:44" (1/1) ... [2021-01-06 19:27:44,922 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:44" (1/1) ... [2021-01-06 19:27:44,971 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:44" (1/1) ... [2021-01-06 19:27:44,982 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:44" (1/1) ... [2021-01-06 19:27:45,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:27:45,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:27:45,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:27:45,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:27:45,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:44" (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:45,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:27:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:27:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:27:45,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:27:47,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:27:47,878 INFO L299 CfgBuilder]: Removed 492 assume(true) statements. [2021-01-06 19:27:47,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:27:47 BoogieIcfgContainer [2021-01-06 19:27:47,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:27:47,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:27:47,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:27:47,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:27:47,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:27:44" (1/3) ... [2021-01-06 19:27:47,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d6ff20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:27:47, skipping insertion in model container [2021-01-06 19:27:47,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:44" (2/3) ... [2021-01-06 19:27:47,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d6ff20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:27:47, skipping insertion in model container [2021-01-06 19:27:47,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:27:47" (3/3) ... [2021-01-06 19:27:47,891 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.11.cil-1.c [2021-01-06 19:27:47,898 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:27:47,904 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 19:27:47,923 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-06 19:27:47,960 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:27:47,961 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:27:47,961 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:27:47,961 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:27:47,961 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:27:47,961 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:27:47,961 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:27:47,962 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:27:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states. [2021-01-06 19:27:48,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:48,016 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:48,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:48,017 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:48,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:48,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1376939346, now seen corresponding path program 1 times [2021-01-06 19:27:48,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:48,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439236415] [2021-01-06 19:27:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:48,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:48,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439236415] [2021-01-06 19:27:48,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:48,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:48,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893454177] [2021-01-06 19:27:48,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:48,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:48,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:48,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:48,363 INFO L87 Difference]: Start difference. First operand 1548 states. Second operand 3 states. [2021-01-06 19:27:48,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:48,569 INFO L93 Difference]: Finished difference Result 3091 states and 4675 transitions. [2021-01-06 19:27:48,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:48,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2021-01-06 19:27:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:48,604 INFO L225 Difference]: With dead ends: 3091 [2021-01-06 19:27:48,604 INFO L226 Difference]: Without dead ends: 1544 [2021-01-06 19:27:48,623 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:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2021-01-06 19:27:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2021-01-06 19:27:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2021-01-06 19:27:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2306 transitions. [2021-01-06 19:27:48,792 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2306 transitions. Word has length 149 [2021-01-06 19:27:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:48,792 INFO L481 AbstractCegarLoop]: Abstraction has 1544 states and 2306 transitions. [2021-01-06 19:27:48,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:48,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2306 transitions. [2021-01-06 19:27:48,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:48,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:48,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:48,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:27:48,807 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:48,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:48,811 INFO L82 PathProgramCache]: Analyzing trace with hash -520040112, now seen corresponding path program 1 times [2021-01-06 19:27:48,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:48,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598859266] [2021-01-06 19:27:48,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:49,087 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:49,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598859266] [2021-01-06 19:27:49,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:49,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:49,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700908] [2021-01-06 19:27:49,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:49,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:49,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:49,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:49,092 INFO L87 Difference]: Start difference. First operand 1544 states and 2306 transitions. Second operand 3 states. [2021-01-06 19:27:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:49,202 INFO L93 Difference]: Finished difference Result 3075 states and 4590 transitions. [2021-01-06 19:27:49,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:49,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2021-01-06 19:27:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:49,213 INFO L225 Difference]: With dead ends: 3075 [2021-01-06 19:27:49,213 INFO L226 Difference]: Without dead ends: 1544 [2021-01-06 19:27:49,218 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:49,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1544 states. [2021-01-06 19:27:49,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1544 to 1544. [2021-01-06 19:27:49,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2021-01-06 19:27:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2305 transitions. [2021-01-06 19:27:49,302 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2305 transitions. Word has length 149 [2021-01-06 19:27:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:49,304 INFO L481 AbstractCegarLoop]: Abstraction has 1544 states and 2305 transitions. [2021-01-06 19:27:49,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2305 transitions. [2021-01-06 19:27:49,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:49,307 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:49,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:49,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:27:49,309 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:49,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:49,312 INFO L82 PathProgramCache]: Analyzing trace with hash -589687986, now seen corresponding path program 1 times [2021-01-06 19:27:49,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:49,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254149703] [2021-01-06 19:27:49,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:49,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254149703] [2021-01-06 19:27:49,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:49,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:49,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222867204] [2021-01-06 19:27:49,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:49,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:49,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:49,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:49,524 INFO L87 Difference]: Start difference. First operand 1544 states and 2305 transitions. Second operand 3 states. [2021-01-06 19:27:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:49,679 INFO L93 Difference]: Finished difference Result 4384 states and 6525 transitions. [2021-01-06 19:27:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:49,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2021-01-06 19:27:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:49,697 INFO L225 Difference]: With dead ends: 4384 [2021-01-06 19:27:49,697 INFO L226 Difference]: Without dead ends: 2856 [2021-01-06 19:27:49,701 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:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2021-01-06 19:27:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2852. [2021-01-06 19:27:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4241 transitions. [2021-01-06 19:27:49,856 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4241 transitions. Word has length 149 [2021-01-06 19:27:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:49,857 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4241 transitions. [2021-01-06 19:27:49,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4241 transitions. [2021-01-06 19:27:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:49,859 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:49,859 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:49,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:27:49,859 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:49,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:49,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1058479562, now seen corresponding path program 1 times [2021-01-06 19:27:49,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:49,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050336778] [2021-01-06 19:27:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:49,937 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:49,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050336778] [2021-01-06 19:27:49,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:49,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:49,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783504081] [2021-01-06 19:27:49,939 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:49,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:49,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:49,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:49,940 INFO L87 Difference]: Start difference. First operand 2852 states and 4241 transitions. Second operand 4 states. [2021-01-06 19:27:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:50,216 INFO L93 Difference]: Finished difference Result 6998 states and 10392 transitions. [2021-01-06 19:27:50,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:50,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:50,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:50,240 INFO L225 Difference]: With dead ends: 6998 [2021-01-06 19:27:50,240 INFO L226 Difference]: Without dead ends: 4163 [2021-01-06 19:27:50,247 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:50,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4163 states. [2021-01-06 19:27:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4163 to 2852. [2021-01-06 19:27:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4238 transitions. [2021-01-06 19:27:50,448 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4238 transitions. Word has length 149 [2021-01-06 19:27:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:50,448 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4238 transitions. [2021-01-06 19:27:50,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4238 transitions. [2021-01-06 19:27:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:50,450 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:50,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:27:50,451 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1421946060, now seen corresponding path program 1 times [2021-01-06 19:27:50,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:50,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143593172] [2021-01-06 19:27:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:50,567 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:50,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143593172] [2021-01-06 19:27:50,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:50,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:50,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166905023] [2021-01-06 19:27:50,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:50,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:50,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:50,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:50,571 INFO L87 Difference]: Start difference. First operand 2852 states and 4238 transitions. Second operand 4 states. [2021-01-06 19:27:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:50,945 INFO L93 Difference]: Finished difference Result 6996 states and 10382 transitions. [2021-01-06 19:27:50,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:50,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:50,975 INFO L225 Difference]: With dead ends: 6996 [2021-01-06 19:27:50,975 INFO L226 Difference]: Without dead ends: 4162 [2021-01-06 19:27:50,984 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:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4162 states. [2021-01-06 19:27:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4162 to 2852. [2021-01-06 19:27:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4235 transitions. [2021-01-06 19:27:51,239 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4235 transitions. Word has length 149 [2021-01-06 19:27:51,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:51,240 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4235 transitions. [2021-01-06 19:27:51,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4235 transitions. [2021-01-06 19:27:51,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:51,242 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:51,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:51,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:27:51,243 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:51,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:51,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1710765450, now seen corresponding path program 1 times [2021-01-06 19:27:51,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:51,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174078829] [2021-01-06 19:27:51,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:51,350 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:51,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174078829] [2021-01-06 19:27:51,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:51,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:51,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300277896] [2021-01-06 19:27:51,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:51,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:51,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:51,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:51,353 INFO L87 Difference]: Start difference. First operand 2852 states and 4235 transitions. Second operand 4 states. [2021-01-06 19:27:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:51,716 INFO L93 Difference]: Finished difference Result 6994 states and 10372 transitions. [2021-01-06 19:27:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:51,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:51,740 INFO L225 Difference]: With dead ends: 6994 [2021-01-06 19:27:51,740 INFO L226 Difference]: Without dead ends: 4161 [2021-01-06 19:27:51,747 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:51,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4161 states. [2021-01-06 19:27:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4161 to 2852. [2021-01-06 19:27:51,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:51,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4232 transitions. [2021-01-06 19:27:51,958 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4232 transitions. Word has length 149 [2021-01-06 19:27:51,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:51,959 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4232 transitions. [2021-01-06 19:27:51,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:51,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4232 transitions. [2021-01-06 19:27:51,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:51,961 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:51,961 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:51,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:27:51,962 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:51,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:51,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1165892876, now seen corresponding path program 1 times [2021-01-06 19:27:51,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:51,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852805728] [2021-01-06 19:27:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:52,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:52,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852805728] [2021-01-06 19:27:52,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:52,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:52,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940805808] [2021-01-06 19:27:52,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:52,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:52,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:52,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:52,057 INFO L87 Difference]: Start difference. First operand 2852 states and 4232 transitions. Second operand 3 states. [2021-01-06 19:27:52,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:52,270 INFO L93 Difference]: Finished difference Result 5684 states and 8433 transitions. [2021-01-06 19:27:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:52,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2021-01-06 19:27:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:52,287 INFO L225 Difference]: With dead ends: 5684 [2021-01-06 19:27:52,287 INFO L226 Difference]: Without dead ends: 2852 [2021-01-06 19:27:52,294 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:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-01-06 19:27:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2021-01-06 19:27:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4224 transitions. [2021-01-06 19:27:52,471 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4224 transitions. Word has length 149 [2021-01-06 19:27:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:52,471 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4224 transitions. [2021-01-06 19:27:52,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:52,471 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4224 transitions. [2021-01-06 19:27:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:52,473 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:52,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:52,474 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:27:52,474 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:52,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1841053002, now seen corresponding path program 1 times [2021-01-06 19:27:52,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:52,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101123328] [2021-01-06 19:27:52,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:52,574 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:52,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101123328] [2021-01-06 19:27:52,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:52,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:52,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137315493] [2021-01-06 19:27:52,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:52,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:52,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:52,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:52,577 INFO L87 Difference]: Start difference. First operand 2852 states and 4224 transitions. Second operand 4 states. [2021-01-06 19:27:52,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:52,890 INFO L93 Difference]: Finished difference Result 6988 states and 10337 transitions. [2021-01-06 19:27:52,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:52,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:52,938 INFO L225 Difference]: With dead ends: 6988 [2021-01-06 19:27:52,938 INFO L226 Difference]: Without dead ends: 4158 [2021-01-06 19:27:52,946 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:52,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4158 states. [2021-01-06 19:27:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4158 to 2852. [2021-01-06 19:27:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4221 transitions. [2021-01-06 19:27:53,140 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4221 transitions. Word has length 149 [2021-01-06 19:27:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:53,140 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4221 transitions. [2021-01-06 19:27:53,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4221 transitions. [2021-01-06 19:27:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:53,142 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:53,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:27:53,145 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:53,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:53,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1256281352, now seen corresponding path program 1 times [2021-01-06 19:27:53,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:53,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011632707] [2021-01-06 19:27:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:53,215 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:53,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011632707] [2021-01-06 19:27:53,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:53,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:53,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911190488] [2021-01-06 19:27:53,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:53,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:53,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:53,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:53,223 INFO L87 Difference]: Start difference. First operand 2852 states and 4221 transitions. Second operand 4 states. [2021-01-06 19:27:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:53,564 INFO L93 Difference]: Finished difference Result 6986 states and 10327 transitions. [2021-01-06 19:27:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:53,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:53,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:53,576 INFO L225 Difference]: With dead ends: 6986 [2021-01-06 19:27:53,576 INFO L226 Difference]: Without dead ends: 4157 [2021-01-06 19:27:53,581 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:53,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4157 states. [2021-01-06 19:27:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4157 to 2852. [2021-01-06 19:27:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4218 transitions. [2021-01-06 19:27:53,757 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4218 transitions. Word has length 149 [2021-01-06 19:27:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:53,763 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4218 transitions. [2021-01-06 19:27:53,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4218 transitions. [2021-01-06 19:27:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:53,765 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:53,765 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:53,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:27:53,766 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:53,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:53,766 INFO L82 PathProgramCache]: Analyzing trace with hash 821775754, now seen corresponding path program 1 times [2021-01-06 19:27:53,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:53,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648055295] [2021-01-06 19:27:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:53,833 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:53,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648055295] [2021-01-06 19:27:53,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:53,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:53,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756031749] [2021-01-06 19:27:53,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:53,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:53,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:53,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:53,839 INFO L87 Difference]: Start difference. First operand 2852 states and 4218 transitions. Second operand 4 states. [2021-01-06 19:27:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:54,191 INFO L93 Difference]: Finished difference Result 6984 states and 10317 transitions. [2021-01-06 19:27:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:54,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:54,203 INFO L225 Difference]: With dead ends: 6984 [2021-01-06 19:27:54,203 INFO L226 Difference]: Without dead ends: 4156 [2021-01-06 19:27:54,209 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:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2021-01-06 19:27:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 2852. [2021-01-06 19:27:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:54,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4215 transitions. [2021-01-06 19:27:54,399 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4215 transitions. Word has length 149 [2021-01-06 19:27:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:54,399 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4215 transitions. [2021-01-06 19:27:54,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4215 transitions. [2021-01-06 19:27:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:54,401 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:54,401 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:54,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:27:54,402 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash 392117448, now seen corresponding path program 1 times [2021-01-06 19:27:54,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:54,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332654383] [2021-01-06 19:27:54,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:54,470 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:54,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332654383] [2021-01-06 19:27:54,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:54,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:54,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140421961] [2021-01-06 19:27:54,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:54,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:54,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:54,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:54,474 INFO L87 Difference]: Start difference. First operand 2852 states and 4215 transitions. Second operand 4 states. [2021-01-06 19:27:54,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:54,846 INFO L93 Difference]: Finished difference Result 6982 states and 10307 transitions. [2021-01-06 19:27:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:54,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:54,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:54,858 INFO L225 Difference]: With dead ends: 6982 [2021-01-06 19:27:54,859 INFO L226 Difference]: Without dead ends: 4155 [2021-01-06 19:27:54,865 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:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4155 states. [2021-01-06 19:27:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4155 to 2852. [2021-01-06 19:27:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4212 transitions. [2021-01-06 19:27:55,090 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4212 transitions. Word has length 149 [2021-01-06 19:27:55,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:55,090 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4212 transitions. [2021-01-06 19:27:55,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:55,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4212 transitions. [2021-01-06 19:27:55,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:55,093 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:55,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:55,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:27:55,093 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:55,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash -314479158, now seen corresponding path program 1 times [2021-01-06 19:27:55,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:55,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380629618] [2021-01-06 19:27:55,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:55,177 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:55,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380629618] [2021-01-06 19:27:55,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:55,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:55,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699378728] [2021-01-06 19:27:55,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:55,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:55,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:55,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:55,180 INFO L87 Difference]: Start difference. First operand 2852 states and 4212 transitions. Second operand 3 states. [2021-01-06 19:27:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:55,368 INFO L93 Difference]: Finished difference Result 5678 states and 8386 transitions. [2021-01-06 19:27:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:55,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2021-01-06 19:27:55,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:55,375 INFO L225 Difference]: With dead ends: 5678 [2021-01-06 19:27:55,375 INFO L226 Difference]: Without dead ends: 2852 [2021-01-06 19:27:55,381 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:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-01-06 19:27:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2021-01-06 19:27:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:55,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4204 transitions. [2021-01-06 19:27:55,554 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4204 transitions. Word has length 149 [2021-01-06 19:27:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:55,554 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4204 transitions. [2021-01-06 19:27:55,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:55,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4204 transitions. [2021-01-06 19:27:55,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:55,556 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:55,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:55,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:27:55,556 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:55,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:55,557 INFO L82 PathProgramCache]: Analyzing trace with hash 123085638, now seen corresponding path program 1 times [2021-01-06 19:27:55,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:55,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519931905] [2021-01-06 19:27:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:55,664 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:55,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519931905] [2021-01-06 19:27:55,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:55,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:55,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641713377] [2021-01-06 19:27:55,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:55,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:55,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:55,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:55,668 INFO L87 Difference]: Start difference. First operand 2852 states and 4204 transitions. Second operand 4 states. [2021-01-06 19:27:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:56,012 INFO L93 Difference]: Finished difference Result 6978 states and 10276 transitions. [2021-01-06 19:27:56,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:56,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:56,024 INFO L225 Difference]: With dead ends: 6978 [2021-01-06 19:27:56,024 INFO L226 Difference]: Without dead ends: 4153 [2021-01-06 19:27:56,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4153 states. [2021-01-06 19:27:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4153 to 2852. [2021-01-06 19:27:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4201 transitions. [2021-01-06 19:27:56,217 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4201 transitions. Word has length 149 [2021-01-06 19:27:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:56,217 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4201 transitions. [2021-01-06 19:27:56,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4201 transitions. [2021-01-06 19:27:56,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:56,219 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:56,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:56,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:27:56,220 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash 984919240, now seen corresponding path program 1 times [2021-01-06 19:27:56,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:56,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330461491] [2021-01-06 19:27:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:56,277 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:56,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330461491] [2021-01-06 19:27:56,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:56,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:56,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461203474] [2021-01-06 19:27:56,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:56,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:56,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:56,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:56,280 INFO L87 Difference]: Start difference. First operand 2852 states and 4201 transitions. Second operand 4 states. [2021-01-06 19:27:56,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:56,743 INFO L93 Difference]: Finished difference Result 6892 states and 10146 transitions. [2021-01-06 19:27:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:56,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:56,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:56,755 INFO L225 Difference]: With dead ends: 6892 [2021-01-06 19:27:56,756 INFO L226 Difference]: Without dead ends: 4068 [2021-01-06 19:27:56,764 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:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2021-01-06 19:27:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 2852. [2021-01-06 19:27:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4198 transitions. [2021-01-06 19:27:56,980 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4198 transitions. Word has length 149 [2021-01-06 19:27:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:56,981 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4198 transitions. [2021-01-06 19:27:56,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4198 transitions. [2021-01-06 19:27:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:56,983 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:56,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:56,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:27:56,983 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:56,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:56,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1065489658, now seen corresponding path program 1 times [2021-01-06 19:27:56,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:56,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051219264] [2021-01-06 19:27:56,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:57,046 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:57,047 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051219264] [2021-01-06 19:27:57,047 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:57,047 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:57,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278368745] [2021-01-06 19:27:57,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:57,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:57,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:57,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:57,049 INFO L87 Difference]: Start difference. First operand 2852 states and 4198 transitions. Second operand 3 states. [2021-01-06 19:27:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:57,304 INFO L93 Difference]: Finished difference Result 5674 states and 8353 transitions. [2021-01-06 19:27:57,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:57,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2021-01-06 19:27:57,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:57,311 INFO L225 Difference]: With dead ends: 5674 [2021-01-06 19:27:57,311 INFO L226 Difference]: Without dead ends: 2852 [2021-01-06 19:27:57,350 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:57,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2852 states. [2021-01-06 19:27:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2852 to 2852. [2021-01-06 19:27:57,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4164 transitions. [2021-01-06 19:27:57,547 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4164 transitions. Word has length 149 [2021-01-06 19:27:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:57,548 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4164 transitions. [2021-01-06 19:27:57,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4164 transitions. [2021-01-06 19:27:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:57,550 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:57,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:57,550 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:27:57,550 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:57,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash 141416899, now seen corresponding path program 1 times [2021-01-06 19:27:57,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:57,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372610991] [2021-01-06 19:27:57,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:57,609 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:57,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372610991] [2021-01-06 19:27:57,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:57,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:57,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942340958] [2021-01-06 19:27:57,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:57,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:57,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:57,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:57,612 INFO L87 Difference]: Start difference. First operand 2852 states and 4164 transitions. Second operand 4 states. [2021-01-06 19:27:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:58,053 INFO L93 Difference]: Finished difference Result 6886 states and 10048 transitions. [2021-01-06 19:27:58,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:58,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:58,063 INFO L225 Difference]: With dead ends: 6886 [2021-01-06 19:27:58,063 INFO L226 Difference]: Without dead ends: 4065 [2021-01-06 19:27:58,069 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:58,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4065 states. [2021-01-06 19:27:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4065 to 2852. [2021-01-06 19:27:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4161 transitions. [2021-01-06 19:27:58,370 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4161 transitions. Word has length 149 [2021-01-06 19:27:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:58,371 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4161 transitions. [2021-01-06 19:27:58,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:58,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4161 transitions. [2021-01-06 19:27:58,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:58,373 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:58,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:58,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:27:58,374 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:58,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:58,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1140755387, now seen corresponding path program 1 times [2021-01-06 19:27:58,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:58,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700710187] [2021-01-06 19:27:58,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:58,479 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:58,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700710187] [2021-01-06 19:27:58,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:58,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:58,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690722295] [2021-01-06 19:27:58,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:58,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:58,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:58,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:58,482 INFO L87 Difference]: Start difference. First operand 2852 states and 4161 transitions. Second operand 4 states. [2021-01-06 19:27:58,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:58,979 INFO L93 Difference]: Finished difference Result 6884 states and 10038 transitions. [2021-01-06 19:27:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:58,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:58,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:58,988 INFO L225 Difference]: With dead ends: 6884 [2021-01-06 19:27:58,988 INFO L226 Difference]: Without dead ends: 4064 [2021-01-06 19:27:58,995 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:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4064 states. [2021-01-06 19:27:59,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4064 to 2852. [2021-01-06 19:27:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:27:59,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4158 transitions. [2021-01-06 19:27:59,221 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4158 transitions. Word has length 149 [2021-01-06 19:27:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:59,222 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4158 transitions. [2021-01-06 19:27:59,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4158 transitions. [2021-01-06 19:27:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:27:59,223 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:59,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:59,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:27:59,224 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:59,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:59,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1311736195, now seen corresponding path program 1 times [2021-01-06 19:27:59,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:59,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792322679] [2021-01-06 19:27:59,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:59,332 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:59,332 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792322679] [2021-01-06 19:27:59,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:59,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:59,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920311956] [2021-01-06 19:27:59,336 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:59,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:59,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:59,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:59,337 INFO L87 Difference]: Start difference. First operand 2852 states and 4158 transitions. Second operand 4 states. [2021-01-06 19:27:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:59,795 INFO L93 Difference]: Finished difference Result 6882 states and 10028 transitions. [2021-01-06 19:27:59,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:59,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:27:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:59,805 INFO L225 Difference]: With dead ends: 6882 [2021-01-06 19:27:59,806 INFO L226 Difference]: Without dead ends: 4063 [2021-01-06 19:27:59,812 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:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4063 states. [2021-01-06 19:28:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4063 to 2852. [2021-01-06 19:28:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:28:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4155 transitions. [2021-01-06 19:28:00,045 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4155 transitions. Word has length 149 [2021-01-06 19:28:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:00,045 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4155 transitions. [2021-01-06 19:28:00,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4155 transitions. [2021-01-06 19:28:00,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:28:00,047 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:00,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:00,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:28:00,047 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:00,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:00,048 INFO L82 PathProgramCache]: Analyzing trace with hash -410266491, now seen corresponding path program 1 times [2021-01-06 19:28:00,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:00,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463736436] [2021-01-06 19:28:00,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:00,116 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:28:00,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463736436] [2021-01-06 19:28:00,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:00,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:00,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268801232] [2021-01-06 19:28:00,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:00,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:00,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:00,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:00,120 INFO L87 Difference]: Start difference. First operand 2852 states and 4155 transitions. Second operand 4 states. [2021-01-06 19:28:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:00,709 INFO L93 Difference]: Finished difference Result 6880 states and 10018 transitions. [2021-01-06 19:28:00,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:00,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:28:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:00,718 INFO L225 Difference]: With dead ends: 6880 [2021-01-06 19:28:00,719 INFO L226 Difference]: Without dead ends: 4062 [2021-01-06 19:28:00,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2021-01-06 19:28:00,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 2852. [2021-01-06 19:28:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:28:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4152 transitions. [2021-01-06 19:28:00,980 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4152 transitions. Word has length 149 [2021-01-06 19:28:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:00,980 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4152 transitions. [2021-01-06 19:28:00,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4152 transitions. [2021-01-06 19:28:00,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:28:00,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:00,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:00,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:28:00,983 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:00,983 INFO L82 PathProgramCache]: Analyzing trace with hash -742909629, now seen corresponding path program 1 times [2021-01-06 19:28:00,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:00,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461857601] [2021-01-06 19:28:00,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:01,054 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:28:01,056 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461857601] [2021-01-06 19:28:01,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:01,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:01,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563335570] [2021-01-06 19:28:01,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:01,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:01,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:01,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:01,058 INFO L87 Difference]: Start difference. First operand 2852 states and 4152 transitions. Second operand 4 states. [2021-01-06 19:28:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:01,555 INFO L93 Difference]: Finished difference Result 6878 states and 10008 transitions. [2021-01-06 19:28:01,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:01,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:28:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:01,564 INFO L225 Difference]: With dead ends: 6878 [2021-01-06 19:28:01,564 INFO L226 Difference]: Without dead ends: 4061 [2021-01-06 19:28:01,569 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:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4061 states. [2021-01-06 19:28:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4061 to 2852. [2021-01-06 19:28:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:28:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4149 transitions. [2021-01-06 19:28:01,801 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4149 transitions. Word has length 149 [2021-01-06 19:28:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:01,801 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4149 transitions. [2021-01-06 19:28:01,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4149 transitions. [2021-01-06 19:28:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:28:01,803 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:01,803 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:01,804 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:28:01,804 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:01,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:01,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1186022597, now seen corresponding path program 1 times [2021-01-06 19:28:01,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:01,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798415356] [2021-01-06 19:28:01,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:01,864 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:28:01,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798415356] [2021-01-06 19:28:01,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:01,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:01,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989339387] [2021-01-06 19:28:01,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:01,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:01,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:01,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:01,866 INFO L87 Difference]: Start difference. First operand 2852 states and 4149 transitions. Second operand 4 states. [2021-01-06 19:28:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:02,342 INFO L93 Difference]: Finished difference Result 6876 states and 9998 transitions. [2021-01-06 19:28:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:02,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:28:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:02,351 INFO L225 Difference]: With dead ends: 6876 [2021-01-06 19:28:02,352 INFO L226 Difference]: Without dead ends: 4060 [2021-01-06 19:28:02,358 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:02,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4060 states. [2021-01-06 19:28:02,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4060 to 2852. [2021-01-06 19:28:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:28:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4146 transitions. [2021-01-06 19:28:02,750 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4146 transitions. Word has length 149 [2021-01-06 19:28:02,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:02,750 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4146 transitions. [2021-01-06 19:28:02,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:02,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4146 transitions. [2021-01-06 19:28:02,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:28:02,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:02,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:02,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:28:02,753 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:02,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:02,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1107058429, now seen corresponding path program 1 times [2021-01-06 19:28:02,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:02,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913179282] [2021-01-06 19:28:02,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:02,837 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:28:02,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913179282] [2021-01-06 19:28:02,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:02,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:02,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101229871] [2021-01-06 19:28:02,838 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:02,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:02,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:02,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:02,839 INFO L87 Difference]: Start difference. First operand 2852 states and 4146 transitions. Second operand 4 states. [2021-01-06 19:28:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:03,385 INFO L93 Difference]: Finished difference Result 6872 states and 9984 transitions. [2021-01-06 19:28:03,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:03,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:28:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:03,394 INFO L225 Difference]: With dead ends: 6872 [2021-01-06 19:28:03,394 INFO L226 Difference]: Without dead ends: 4058 [2021-01-06 19:28:03,399 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:03,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2021-01-06 19:28:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 2852. [2021-01-06 19:28:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:28:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4143 transitions. [2021-01-06 19:28:03,639 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4143 transitions. Word has length 149 [2021-01-06 19:28:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:03,640 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4143 transitions. [2021-01-06 19:28:03,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4143 transitions. [2021-01-06 19:28:03,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:28:03,642 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:03,642 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:03,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:28:03,643 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:03,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:03,643 INFO L82 PathProgramCache]: Analyzing trace with hash -635702079, now seen corresponding path program 1 times [2021-01-06 19:28:03,643 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:03,643 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279398755] [2021-01-06 19:28:03,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:03,701 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:28:03,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279398755] [2021-01-06 19:28:03,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:03,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:03,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708303745] [2021-01-06 19:28:03,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:03,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:03,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:03,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:03,704 INFO L87 Difference]: Start difference. First operand 2852 states and 4143 transitions. Second operand 4 states. [2021-01-06 19:28:04,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:04,193 INFO L93 Difference]: Finished difference Result 6870 states and 9974 transitions. [2021-01-06 19:28:04,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:04,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2021-01-06 19:28:04,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:04,202 INFO L225 Difference]: With dead ends: 6870 [2021-01-06 19:28:04,202 INFO L226 Difference]: Without dead ends: 4057 [2021-01-06 19:28:04,207 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:04,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4057 states. [2021-01-06 19:28:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4057 to 2852. [2021-01-06 19:28:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2021-01-06 19:28:04,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4140 transitions. [2021-01-06 19:28:04,463 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4140 transitions. Word has length 149 [2021-01-06 19:28:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:04,464 INFO L481 AbstractCegarLoop]: Abstraction has 2852 states and 4140 transitions. [2021-01-06 19:28:04,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:04,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4140 transitions. [2021-01-06 19:28:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-01-06 19:28:04,465 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:04,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:04,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:28:04,466 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:04,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2011902275, now seen corresponding path program 1 times [2021-01-06 19:28:04,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:04,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501927274] [2021-01-06 19:28:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:04,543 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:28:04,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501927274] [2021-01-06 19:28:04,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:04,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:04,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236979194] [2021-01-06 19:28:04,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:04,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:04,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:04,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:04,548 INFO L87 Difference]: Start difference. First operand 2852 states and 4140 transitions. Second operand 3 states. [2021-01-06 19:28:04,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:04,967 INFO L93 Difference]: Finished difference Result 8322 states and 12064 transitions. [2021-01-06 19:28:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:04,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2021-01-06 19:28:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:04,977 INFO L225 Difference]: With dead ends: 8322 [2021-01-06 19:28:04,978 INFO L226 Difference]: Without dead ends: 5511 [2021-01-06 19:28:04,982 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:28:04,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5511 states. [2021-01-06 19:28:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5511 to 5347. [2021-01-06 19:28:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5347 states. [2021-01-06 19:28:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5347 states to 5347 states and 7719 transitions. [2021-01-06 19:28:05,439 INFO L78 Accepts]: Start accepts. Automaton has 5347 states and 7719 transitions. Word has length 149 [2021-01-06 19:28:05,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:05,440 INFO L481 AbstractCegarLoop]: Abstraction has 5347 states and 7719 transitions. [2021-01-06 19:28:05,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:05,440 INFO L276 IsEmpty]: Start isEmpty. Operand 5347 states and 7719 transitions. [2021-01-06 19:28:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:05,445 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:05,445 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:05,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:28:05,445 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:05,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1491904716, now seen corresponding path program 1 times [2021-01-06 19:28:05,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:05,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330842384] [2021-01-06 19:28:05,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:05,540 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:05,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330842384] [2021-01-06 19:28:05,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:05,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:05,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431632866] [2021-01-06 19:28:05,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:05,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:05,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:05,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:05,543 INFO L87 Difference]: Start difference. First operand 5347 states and 7719 transitions. Second operand 5 states. [2021-01-06 19:28:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:06,925 INFO L93 Difference]: Finished difference Result 15824 states and 22859 transitions. [2021-01-06 19:28:06,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:06,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2021-01-06 19:28:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:06,943 INFO L225 Difference]: With dead ends: 15824 [2021-01-06 19:28:06,944 INFO L226 Difference]: Without dead ends: 10522 [2021-01-06 19:28:06,953 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:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10522 states. [2021-01-06 19:28:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10522 to 5428. [2021-01-06 19:28:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5428 states. [2021-01-06 19:28:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 7774 transitions. [2021-01-06 19:28:07,485 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 7774 transitions. Word has length 243 [2021-01-06 19:28:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:07,486 INFO L481 AbstractCegarLoop]: Abstraction has 5428 states and 7774 transitions. [2021-01-06 19:28:07,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 7774 transitions. [2021-01-06 19:28:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:07,491 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:07,491 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:07,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:28:07,492 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:07,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:07,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1775890254, now seen corresponding path program 1 times [2021-01-06 19:28:07,493 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:07,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431976700] [2021-01-06 19:28:07,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:07,617 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,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431976700] [2021-01-06 19:28:07,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:07,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:07,618 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661675991] [2021-01-06 19:28:07,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:07,619 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:07,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:07,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:07,620 INFO L87 Difference]: Start difference. First operand 5428 states and 7774 transitions. Second operand 5 states. [2021-01-06 19:28:08,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:08,925 INFO L93 Difference]: Finished difference Result 20669 states and 29665 transitions. [2021-01-06 19:28:08,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:08,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2021-01-06 19:28:08,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:08,947 INFO L225 Difference]: With dead ends: 20669 [2021-01-06 19:28:08,948 INFO L226 Difference]: Without dead ends: 15293 [2021-01-06 19:28:08,956 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:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15293 states. [2021-01-06 19:28:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15293 to 5587. [2021-01-06 19:28:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5587 states. [2021-01-06 19:28:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5587 states to 5587 states and 7933 transitions. [2021-01-06 19:28:09,507 INFO L78 Accepts]: Start accepts. Automaton has 5587 states and 7933 transitions. Word has length 243 [2021-01-06 19:28:09,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:09,507 INFO L481 AbstractCegarLoop]: Abstraction has 5587 states and 7933 transitions. [2021-01-06 19:28:09,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5587 states and 7933 transitions. [2021-01-06 19:28:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:09,513 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:09,513 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:09,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:28:09,513 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:09,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash -304693424, now seen corresponding path program 1 times [2021-01-06 19:28:09,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:09,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463611177] [2021-01-06 19:28:09,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:09,605 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:09,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463611177] [2021-01-06 19:28:09,606 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:09,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:09,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105584716] [2021-01-06 19:28:09,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:09,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:09,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:09,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:09,608 INFO L87 Difference]: Start difference. First operand 5587 states and 7933 transitions. Second operand 5 states. [2021-01-06 19:28:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:10,410 INFO L93 Difference]: Finished difference Result 13586 states and 19236 transitions. [2021-01-06 19:28:10,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:10,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2021-01-06 19:28:10,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:10,421 INFO L225 Difference]: With dead ends: 13586 [2021-01-06 19:28:10,421 INFO L226 Difference]: Without dead ends: 8061 [2021-01-06 19:28:10,428 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:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8061 states. [2021-01-06 19:28:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8061 to 5599. [2021-01-06 19:28:10,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5599 states. [2021-01-06 19:28:11,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5599 states to 5599 states and 7896 transitions. [2021-01-06 19:28:11,003 INFO L78 Accepts]: Start accepts. Automaton has 5599 states and 7896 transitions. Word has length 243 [2021-01-06 19:28:11,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:11,003 INFO L481 AbstractCegarLoop]: Abstraction has 5599 states and 7896 transitions. [2021-01-06 19:28:11,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:11,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5599 states and 7896 transitions. [2021-01-06 19:28:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:11,007 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:11,008 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:11,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:28:11,008 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:11,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:11,009 INFO L82 PathProgramCache]: Analyzing trace with hash 838466900, now seen corresponding path program 1 times [2021-01-06 19:28:11,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:11,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132034852] [2021-01-06 19:28:11,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:11,102 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:11,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132034852] [2021-01-06 19:28:11,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:11,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:11,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079833049] [2021-01-06 19:28:11,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:11,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:11,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:11,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:11,104 INFO L87 Difference]: Start difference. First operand 5599 states and 7896 transitions. Second operand 4 states. [2021-01-06 19:28:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:12,373 INFO L93 Difference]: Finished difference Result 18971 states and 26714 transitions. [2021-01-06 19:28:12,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:12,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2021-01-06 19:28:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:12,385 INFO L225 Difference]: With dead ends: 18971 [2021-01-06 19:28:12,385 INFO L226 Difference]: Without dead ends: 13436 [2021-01-06 19:28:12,393 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:12,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13436 states. [2021-01-06 19:28:13,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13436 to 10632. [2021-01-06 19:28:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10632 states. [2021-01-06 19:28:13,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10632 states to 10632 states and 14932 transitions. [2021-01-06 19:28:13,546 INFO L78 Accepts]: Start accepts. Automaton has 10632 states and 14932 transitions. Word has length 243 [2021-01-06 19:28:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:13,546 INFO L481 AbstractCegarLoop]: Abstraction has 10632 states and 14932 transitions. [2021-01-06 19:28:13,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:13,547 INFO L276 IsEmpty]: Start isEmpty. Operand 10632 states and 14932 transitions. [2021-01-06 19:28:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:13,555 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:13,555 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:13,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:28:13,556 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:13,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:13,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1391960918, now seen corresponding path program 1 times [2021-01-06 19:28:13,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:13,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46450245] [2021-01-06 19:28:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:13,665 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:13,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46450245] [2021-01-06 19:28:13,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:13,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:13,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486496544] [2021-01-06 19:28:13,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:13,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:13,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:13,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:13,667 INFO L87 Difference]: Start difference. First operand 10632 states and 14932 transitions. Second operand 5 states. [2021-01-06 19:28:15,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:15,440 INFO L93 Difference]: Finished difference Result 30310 states and 42801 transitions. [2021-01-06 19:28:15,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:15,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2021-01-06 19:28:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:15,458 INFO L225 Difference]: With dead ends: 30310 [2021-01-06 19:28:15,459 INFO L226 Difference]: Without dead ends: 19746 [2021-01-06 19:28:15,469 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:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19746 states. [2021-01-06 19:28:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19746 to 10788. [2021-01-06 19:28:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10788 states. [2021-01-06 19:28:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10788 states to 10788 states and 15039 transitions. [2021-01-06 19:28:16,536 INFO L78 Accepts]: Start accepts. Automaton has 10788 states and 15039 transitions. Word has length 243 [2021-01-06 19:28:16,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:16,536 INFO L481 AbstractCegarLoop]: Abstraction has 10788 states and 15039 transitions. [2021-01-06 19:28:16,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:16,537 INFO L276 IsEmpty]: Start isEmpty. Operand 10788 states and 15039 transitions. [2021-01-06 19:28:16,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:16,544 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:16,544 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:16,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:28:16,545 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:16,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:16,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1238545498, now seen corresponding path program 1 times [2021-01-06 19:28:16,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:16,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556419776] [2021-01-06 19:28:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:16,639 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:16,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556419776] [2021-01-06 19:28:16,639 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:16,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:16,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737170954] [2021-01-06 19:28:16,640 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:16,640 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:16,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:16,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:16,641 INFO L87 Difference]: Start difference. First operand 10788 states and 15039 transitions. Second operand 4 states. [2021-01-06 19:28:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:19,185 INFO L93 Difference]: Finished difference Result 36674 states and 51051 transitions. [2021-01-06 19:28:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:19,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2021-01-06 19:28:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:19,212 INFO L225 Difference]: With dead ends: 36674 [2021-01-06 19:28:19,212 INFO L226 Difference]: Without dead ends: 25963 [2021-01-06 19:28:19,226 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:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25963 states. [2021-01-06 19:28:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25963 to 20595. [2021-01-06 19:28:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20595 states. [2021-01-06 19:28:21,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20595 states to 20595 states and 28596 transitions. [2021-01-06 19:28:21,067 INFO L78 Accepts]: Start accepts. Automaton has 20595 states and 28596 transitions. Word has length 243 [2021-01-06 19:28:21,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:21,068 INFO L481 AbstractCegarLoop]: Abstraction has 20595 states and 28596 transitions. [2021-01-06 19:28:21,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 20595 states and 28596 transitions. [2021-01-06 19:28:21,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:21,078 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:21,079 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:21,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:28:21,079 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:21,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:21,079 INFO L82 PathProgramCache]: Analyzing trace with hash -643314340, now seen corresponding path program 1 times [2021-01-06 19:28:21,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:21,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212057337] [2021-01-06 19:28:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:21,172 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:21,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212057337] [2021-01-06 19:28:21,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:21,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:21,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731181402] [2021-01-06 19:28:21,174 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:21,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:21,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:21,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:21,174 INFO L87 Difference]: Start difference. First operand 20595 states and 28596 transitions. Second operand 5 states. [2021-01-06 19:28:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:24,762 INFO L93 Difference]: Finished difference Result 57445 states and 80278 transitions. [2021-01-06 19:28:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:24,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2021-01-06 19:28:24,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:24,796 INFO L225 Difference]: With dead ends: 57445 [2021-01-06 19:28:24,796 INFO L226 Difference]: Without dead ends: 36931 [2021-01-06 19:28:24,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:28:24,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36931 states. [2021-01-06 19:28:27,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36931 to 20895. [2021-01-06 19:28:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20895 states. [2021-01-06 19:28:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20895 states to 20895 states and 28803 transitions. [2021-01-06 19:28:27,270 INFO L78 Accepts]: Start accepts. Automaton has 20895 states and 28803 transitions. Word has length 243 [2021-01-06 19:28:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:27,270 INFO L481 AbstractCegarLoop]: Abstraction has 20895 states and 28803 transitions. [2021-01-06 19:28:27,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 20895 states and 28803 transitions. [2021-01-06 19:28:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:27,280 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:27,280 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:27,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:28:27,281 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:27,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1408320608, now seen corresponding path program 1 times [2021-01-06 19:28:27,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:27,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834169564] [2021-01-06 19:28:27,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:27,378 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:27,378 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834169564] [2021-01-06 19:28:27,378 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:27,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:27,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612482868] [2021-01-06 19:28:27,379 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:27,379 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:27,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:27,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:27,380 INFO L87 Difference]: Start difference. First operand 20895 states and 28803 transitions. Second operand 5 states. [2021-01-06 19:28:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:32,562 INFO L93 Difference]: Finished difference Result 72271 states and 100599 transitions. [2021-01-06 19:28:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:32,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2021-01-06 19:28:32,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:32,607 INFO L225 Difference]: With dead ends: 72271 [2021-01-06 19:28:32,608 INFO L226 Difference]: Without dead ends: 51464 [2021-01-06 19:28:32,624 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,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51464 states. [2021-01-06 19:28:35,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51464 to 21474. [2021-01-06 19:28:35,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21474 states. [2021-01-06 19:28:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21474 states to 21474 states and 29382 transitions. [2021-01-06 19:28:35,176 INFO L78 Accepts]: Start accepts. Automaton has 21474 states and 29382 transitions. Word has length 243 [2021-01-06 19:28:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:35,176 INFO L481 AbstractCegarLoop]: Abstraction has 21474 states and 29382 transitions. [2021-01-06 19:28:35,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 21474 states and 29382 transitions. [2021-01-06 19:28:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:35,186 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:35,186 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:35,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:28:35,186 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:35,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:35,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1001304476, now seen corresponding path program 1 times [2021-01-06 19:28:35,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:35,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743517677] [2021-01-06 19:28:35,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:35,327 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:35,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743517677] [2021-01-06 19:28:35,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:35,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:35,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142261415] [2021-01-06 19:28:35,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:35,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:35,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:35,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:35,330 INFO L87 Difference]: Start difference. First operand 21474 states and 29382 transitions. Second operand 4 states. [2021-01-06 19:28:41,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:41,122 INFO L93 Difference]: Finished difference Result 72990 states and 99731 transitions. [2021-01-06 19:28:41,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:41,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2021-01-06 19:28:41,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:41,191 INFO L225 Difference]: With dead ends: 72990 [2021-01-06 19:28:41,191 INFO L226 Difference]: Without dead ends: 51609 [2021-01-06 19:28:41,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:28:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51609 states. [2021-01-06 19:28:46,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51609 to 41081. [2021-01-06 19:28:46,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41081 states. [2021-01-06 19:28:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41081 states to 41081 states and 55999 transitions. [2021-01-06 19:28:46,127 INFO L78 Accepts]: Start accepts. Automaton has 41081 states and 55999 transitions. Word has length 243 [2021-01-06 19:28:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:46,127 INFO L481 AbstractCegarLoop]: Abstraction has 41081 states and 55999 transitions. [2021-01-06 19:28:46,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 41081 states and 55999 transitions. [2021-01-06 19:28:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:46,142 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:46,142 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:46,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:28:46,143 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:46,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:46,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1280465510, now seen corresponding path program 1 times [2021-01-06 19:28:46,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:46,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153540691] [2021-01-06 19:28:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:46,245 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:46,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153540691] [2021-01-06 19:28:46,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:46,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:46,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090527414] [2021-01-06 19:28:46,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:46,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:46,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:46,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:46,248 INFO L87 Difference]: Start difference. First operand 41081 states and 55999 transitions. Second operand 5 states. [2021-01-06 19:28:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:54,328 INFO L93 Difference]: Finished difference Result 111745 states and 153445 transitions. [2021-01-06 19:28:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:54,328 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2021-01-06 19:28:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:54,396 INFO L225 Difference]: With dead ends: 111745 [2021-01-06 19:28:54,396 INFO L226 Difference]: Without dead ends: 70761 [2021-01-06 19:28:54,422 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:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70761 states. [2021-01-06 19:28:59,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70761 to 41657. [2021-01-06 19:28:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41657 states. [2021-01-06 19:28:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41657 states to 41657 states and 56398 transitions. [2021-01-06 19:28:59,662 INFO L78 Accepts]: Start accepts. Automaton has 41657 states and 56398 transitions. Word has length 243 [2021-01-06 19:28:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:59,662 INFO L481 AbstractCegarLoop]: Abstraction has 41657 states and 56398 transitions. [2021-01-06 19:28:59,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:59,662 INFO L276 IsEmpty]: Start isEmpty. Operand 41657 states and 56398 transitions. [2021-01-06 19:28:59,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:28:59,676 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:59,676 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:59,676 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:28:59,676 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:59,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1609774954, now seen corresponding path program 1 times [2021-01-06 19:28:59,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:59,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953849373] [2021-01-06 19:28:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:59,798 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:59,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953849373] [2021-01-06 19:28:59,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:59,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:59,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544478688] [2021-01-06 19:28:59,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:59,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:59,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:59,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:59,801 INFO L87 Difference]: Start difference. First operand 41657 states and 56398 transitions. Second operand 5 states. [2021-01-06 19:29:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:10,849 INFO L93 Difference]: Finished difference Result 138479 states and 189478 transitions. [2021-01-06 19:29:10,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:10,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2021-01-06 19:29:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:11,110 INFO L225 Difference]: With dead ends: 138479 [2021-01-06 19:29:11,110 INFO L226 Difference]: Without dead ends: 96926 [2021-01-06 19:29:11,138 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:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96926 states. [2021-01-06 19:29:16,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96926 to 42764. [2021-01-06 19:29:16,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42764 states. [2021-01-06 19:29:16,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42764 states to 42764 states and 57505 transitions. [2021-01-06 19:29:16,688 INFO L78 Accepts]: Start accepts. Automaton has 42764 states and 57505 transitions. Word has length 243 [2021-01-06 19:29:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:16,689 INFO L481 AbstractCegarLoop]: Abstraction has 42764 states and 57505 transitions. [2021-01-06 19:29:16,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 42764 states and 57505 transitions. [2021-01-06 19:29:16,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:29:16,703 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:16,703 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:16,704 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:29:16,704 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:16,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:16,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1238611476, now seen corresponding path program 1 times [2021-01-06 19:29:16,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:16,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905334974] [2021-01-06 19:29:16,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:16,815 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:16,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905334974] [2021-01-06 19:29:16,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:16,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:16,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836300352] [2021-01-06 19:29:16,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:16,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:16,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:16,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:16,817 INFO L87 Difference]: Start difference. First operand 42764 states and 57505 transitions. Second operand 4 states. [2021-01-06 19:29:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:29,543 INFO L93 Difference]: Finished difference Result 145070 states and 194806 transitions. [2021-01-06 19:29:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:29,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2021-01-06 19:29:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:29,649 INFO L225 Difference]: With dead ends: 145070 [2021-01-06 19:29:29,649 INFO L226 Difference]: Without dead ends: 102415 [2021-01-06 19:29:29,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102415 states. [2021-01-06 19:29:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102415 to 81835. [2021-01-06 19:29:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81835 states. [2021-01-06 19:29:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81835 states to 81835 states and 109662 transitions. [2021-01-06 19:29:40,221 INFO L78 Accepts]: Start accepts. Automaton has 81835 states and 109662 transitions. Word has length 243 [2021-01-06 19:29:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:40,221 INFO L481 AbstractCegarLoop]: Abstraction has 81835 states and 109662 transitions. [2021-01-06 19:29:40,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 81835 states and 109662 transitions. [2021-01-06 19:29:40,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:29:40,240 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:40,240 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:40,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:29:40,241 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:40,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:40,241 INFO L82 PathProgramCache]: Analyzing trace with hash -682035539, now seen corresponding path program 1 times [2021-01-06 19:29:40,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:40,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685661993] [2021-01-06 19:29:40,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:40,339 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,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685661993] [2021-01-06 19:29:40,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:40,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:40,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990637231] [2021-01-06 19:29:40,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:40,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:40,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:40,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:40,342 INFO L87 Difference]: Start difference. First operand 81835 states and 109662 transitions. Second operand 5 states. [2021-01-06 19:29:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:57,387 INFO L93 Difference]: Finished difference Result 217261 states and 293268 transitions. [2021-01-06 19:29:57,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:57,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2021-01-06 19:29:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:57,717 INFO L225 Difference]: With dead ends: 217261 [2021-01-06 19:29:57,717 INFO L226 Difference]: Without dead ends: 135539 [2021-01-06 19:29:57,779 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:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135539 states. [2021-01-06 19:30:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135539 to 82939. [2021-01-06 19:30:09,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82939 states. [2021-01-06 19:30:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82939 states to 82939 states and 110429 transitions. [2021-01-06 19:30:09,478 INFO L78 Accepts]: Start accepts. Automaton has 82939 states and 110429 transitions. Word has length 243 [2021-01-06 19:30:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:09,478 INFO L481 AbstractCegarLoop]: Abstraction has 82939 states and 110429 transitions. [2021-01-06 19:30:09,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:09,479 INFO L276 IsEmpty]: Start isEmpty. Operand 82939 states and 110429 transitions. [2021-01-06 19:30:09,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:30:09,497 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:09,497 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:09,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 19:30:09,498 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:09,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:09,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1214943919, now seen corresponding path program 1 times [2021-01-06 19:30:09,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:09,499 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033682163] [2021-01-06 19:30:09,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:09,603 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:30:09,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033682163] [2021-01-06 19:30:09,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:09,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:09,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641645644] [2021-01-06 19:30:09,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:09,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:09,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:09,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:09,605 INFO L87 Difference]: Start difference. First operand 82939 states and 110429 transitions. Second operand 5 states. [2021-01-06 19:30:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:33,248 INFO L93 Difference]: Finished difference Result 265383 states and 356937 transitions. [2021-01-06 19:30:33,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:33,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 243 [2021-01-06 19:30:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:33,628 INFO L225 Difference]: With dead ends: 265383 [2021-01-06 19:30:33,629 INFO L226 Difference]: Without dead ends: 182564 [2021-01-06 19:30:33,724 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:30:33,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182564 states. [2021-01-06 19:30:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182564 to 85054. [2021-01-06 19:30:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85054 states. [2021-01-06 19:30:46,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85054 states to 85054 states and 112544 transitions. [2021-01-06 19:30:46,367 INFO L78 Accepts]: Start accepts. Automaton has 85054 states and 112544 transitions. Word has length 243 [2021-01-06 19:30:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:46,368 INFO L481 AbstractCegarLoop]: Abstraction has 85054 states and 112544 transitions. [2021-01-06 19:30:46,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 85054 states and 112544 transitions. [2021-01-06 19:30:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:30:46,394 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:46,395 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:46,395 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 19:30:46,395 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:46,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:46,395 INFO L82 PathProgramCache]: Analyzing trace with hash -572925903, now seen corresponding path program 1 times [2021-01-06 19:30:46,396 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:46,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124214148] [2021-01-06 19:30:46,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:46,701 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:30:46,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124214148] [2021-01-06 19:30:46,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:46,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:46,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350983082] [2021-01-06 19:30:46,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:46,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:46,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:46,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:46,702 INFO L87 Difference]: Start difference. First operand 85054 states and 112544 transitions. Second operand 4 states.