/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/transmitter.09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:30:32,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:30:32,518 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:30:32,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:30:32,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:30:32,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:30:32,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:30:32,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:30:32,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:30:32,565 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:30:32,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:30:32,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:30:32,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:30:32,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:30:32,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:30:32,573 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:30:32,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:30:32,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:30:32,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:30:32,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:30:32,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:30:32,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:30:32,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:30:32,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:30:32,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:30:32,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:30:32,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:30:32,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:30:32,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:30:32,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:30:32,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:30:32,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:30:32,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:30:32,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:30:32,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:30:32,618 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:30:32,619 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:30:32,619 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:30:32,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:30:32,621 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:30:32,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:30:32,623 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:30:32,656 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:30:32,656 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:30:32,658 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:30:32,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:30:32,658 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:30:32,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:30:32,659 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:30:32,659 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:30:32,660 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:30:32,660 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:30:32,660 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:30:32,660 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:30:32,661 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:30:32,661 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:30:32,661 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:30:32,661 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:30:32,662 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:30:32,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:30:32,662 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:30:32,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:30:32,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:30:32,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:30:32,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:30:32,664 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:30:32,664 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:30:32,664 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:30:33,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:30:33,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:30:33,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:30:33,092 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:30:33,093 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:30:33,094 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.09.cil.c [2021-01-06 19:30:33,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c309e9e26/8e997ea3309b4ef0a0ee23f973b3eae8/FLAGc7425d62f [2021-01-06 19:30:33,909 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:30:33,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c [2021-01-06 19:30:33,934 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c309e9e26/8e997ea3309b4ef0a0ee23f973b3eae8/FLAGc7425d62f [2021-01-06 19:30:34,238 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/c309e9e26/8e997ea3309b4ef0a0ee23f973b3eae8 [2021-01-06 19:30:34,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:30:34,247 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:30:34,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:30:34,251 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:30:34,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:30:34,256 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:30:34" (1/1) ... [2021-01-06 19:30:34,258 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e34c649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34, skipping insertion in model container [2021-01-06 19:30:34,259 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:30:34" (1/1) ... [2021-01-06 19:30:34,267 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:30:34,339 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:30:34,488 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] [2021-01-06 19:30:34,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:30:34,696 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:30:34,710 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.09.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] [2021-01-06 19:30:34,788 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:30:34,832 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:30:34,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34 WrapperNode [2021-01-06 19:30:34,833 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:30:34,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:30:34,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:30:34,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:30:34,845 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:30:34" (1/1) ... [2021-01-06 19:30:34,880 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:30:34" (1/1) ... [2021-01-06 19:30:35,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:30:35,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:30:35,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:30:35,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:30:35,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34" (1/1) ... [2021-01-06 19:30:35,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34" (1/1) ... [2021-01-06 19:30:35,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34" (1/1) ... [2021-01-06 19:30:35,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34" (1/1) ... [2021-01-06 19:30:35,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34" (1/1) ... [2021-01-06 19:30:35,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34" (1/1) ... [2021-01-06 19:30:35,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34" (1/1) ... [2021-01-06 19:30:35,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:30:35,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:30:35,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:30:35,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:30:35,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34" (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:30:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:30:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:30:35,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:30:35,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:30:37,480 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:30:37,480 INFO L299 CfgBuilder]: Removed 353 assume(true) statements. [2021-01-06 19:30:37,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:30:37 BoogieIcfgContainer [2021-01-06 19:30:37,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:30:37,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:30:37,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:30:37,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:30:37,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:30:34" (1/3) ... [2021-01-06 19:30:37,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0d4a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:30:37, skipping insertion in model container [2021-01-06 19:30:37,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:34" (2/3) ... [2021-01-06 19:30:37,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0d4a65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:30:37, skipping insertion in model container [2021-01-06 19:30:37,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:30:37" (3/3) ... [2021-01-06 19:30:37,493 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.09.cil.c [2021-01-06 19:30:37,500 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:30:37,506 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:30:37,521 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:30:37,560 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:30:37,560 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:30:37,560 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:30:37,561 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:30:37,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:30:37,561 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:30:37,561 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:30:37,561 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:30:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states. [2021-01-06 19:30:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:37,636 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:37,637 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] [2021-01-06 19:30:37,638 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:37,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:37,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1244960034, now seen corresponding path program 1 times [2021-01-06 19:30:37,652 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:37,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846842514] [2021-01-06 19:30:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:38,020 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:30:38,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846842514] [2021-01-06 19:30:38,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:38,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:38,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672078526] [2021-01-06 19:30:38,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:38,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:38,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:38,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:38,060 INFO L87 Difference]: Start difference. First operand 1074 states. Second operand 3 states. [2021-01-06 19:30:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:38,228 INFO L93 Difference]: Finished difference Result 2143 states and 3269 transitions. [2021-01-06 19:30:38,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:38,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2021-01-06 19:30:38,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:38,285 INFO L225 Difference]: With dead ends: 2143 [2021-01-06 19:30:38,285 INFO L226 Difference]: Without dead ends: 1070 [2021-01-06 19:30:38,298 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:30:38,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2021-01-06 19:30:38,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2021-01-06 19:30:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2021-01-06 19:30:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1606 transitions. [2021-01-06 19:30:38,442 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1606 transitions. Word has length 133 [2021-01-06 19:30:38,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:38,443 INFO L481 AbstractCegarLoop]: Abstraction has 1070 states and 1606 transitions. [2021-01-06 19:30:38,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:38,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1606 transitions. [2021-01-06 19:30:38,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:38,454 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:38,455 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] [2021-01-06 19:30:38,456 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:30:38,456 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:38,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:38,457 INFO L82 PathProgramCache]: Analyzing trace with hash -2101955296, now seen corresponding path program 1 times [2021-01-06 19:30:38,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:38,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656992974] [2021-01-06 19:30:38,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:38,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:38,614 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:30:38,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656992974] [2021-01-06 19:30:38,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:38,616 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:38,616 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963214185] [2021-01-06 19:30:38,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:38,618 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:38,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:38,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:38,619 INFO L87 Difference]: Start difference. First operand 1070 states and 1606 transitions. Second operand 3 states. [2021-01-06 19:30:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:38,670 INFO L93 Difference]: Finished difference Result 2127 states and 3190 transitions. [2021-01-06 19:30:38,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:38,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2021-01-06 19:30:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:38,676 INFO L225 Difference]: With dead ends: 2127 [2021-01-06 19:30:38,676 INFO L226 Difference]: Without dead ends: 1070 [2021-01-06 19:30:38,679 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:30:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2021-01-06 19:30:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2021-01-06 19:30:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2021-01-06 19:30:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1605 transitions. [2021-01-06 19:30:38,718 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1605 transitions. Word has length 133 [2021-01-06 19:30:38,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:38,719 INFO L481 AbstractCegarLoop]: Abstraction has 1070 states and 1605 transitions. [2021-01-06 19:30:38,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1605 transitions. [2021-01-06 19:30:38,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:38,721 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:38,721 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] [2021-01-06 19:30:38,721 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:30:38,722 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:38,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:38,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1704964894, now seen corresponding path program 1 times [2021-01-06 19:30:38,723 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:38,723 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823815981] [2021-01-06 19:30:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:38,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:30:38,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823815981] [2021-01-06 19:30:38,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:38,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:38,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348733201] [2021-01-06 19:30:38,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:38,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:38,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:38,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:38,844 INFO L87 Difference]: Start difference. First operand 1070 states and 1605 transitions. Second operand 3 states. [2021-01-06 19:30:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:39,041 INFO L93 Difference]: Finished difference Result 3004 states and 4493 transitions. [2021-01-06 19:30:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:39,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2021-01-06 19:30:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:39,052 INFO L225 Difference]: With dead ends: 3004 [2021-01-06 19:30:39,052 INFO L226 Difference]: Without dead ends: 1948 [2021-01-06 19:30:39,055 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:30:39,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2021-01-06 19:30:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1946. [2021-01-06 19:30:39,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2895 transitions. [2021-01-06 19:30:39,151 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2895 transitions. Word has length 133 [2021-01-06 19:30:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:39,158 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2895 transitions. [2021-01-06 19:30:39,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:39,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2895 transitions. [2021-01-06 19:30:39,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:39,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:39,162 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] [2021-01-06 19:30:39,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:30:39,163 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:39,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:39,164 INFO L82 PathProgramCache]: Analyzing trace with hash 612329692, now seen corresponding path program 1 times [2021-01-06 19:30:39,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:39,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646131430] [2021-01-06 19:30:39,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:39,296 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:30:39,296 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646131430] [2021-01-06 19:30:39,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:39,297 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:39,297 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663603867] [2021-01-06 19:30:39,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:39,298 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:39,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:39,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:39,299 INFO L87 Difference]: Start difference. First operand 1946 states and 2895 transitions. Second operand 4 states. [2021-01-06 19:30:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:39,573 INFO L93 Difference]: Finished difference Result 4754 states and 7058 transitions. [2021-01-06 19:30:39,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:39,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:39,588 INFO L225 Difference]: With dead ends: 4754 [2021-01-06 19:30:39,588 INFO L226 Difference]: Without dead ends: 2823 [2021-01-06 19:30:39,592 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2021-01-06 19:30:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 1946. [2021-01-06 19:30:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:39,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2892 transitions. [2021-01-06 19:30:39,684 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2892 transitions. Word has length 133 [2021-01-06 19:30:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:39,685 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2892 transitions. [2021-01-06 19:30:39,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2892 transitions. [2021-01-06 19:30:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:39,687 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:39,687 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:39,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:30:39,688 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:39,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:39,688 INFO L82 PathProgramCache]: Analyzing trace with hash -669842594, now seen corresponding path program 1 times [2021-01-06 19:30:39,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:39,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180258876] [2021-01-06 19:30:39,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:39,817 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:30:39,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180258876] [2021-01-06 19:30:39,818 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:39,818 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:39,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645696960] [2021-01-06 19:30:39,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:39,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:39,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:39,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:39,820 INFO L87 Difference]: Start difference. First operand 1946 states and 2892 transitions. Second operand 4 states. [2021-01-06 19:30:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:40,155 INFO L93 Difference]: Finished difference Result 4752 states and 7048 transitions. [2021-01-06 19:30:40,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:40,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:40,178 INFO L225 Difference]: With dead ends: 4752 [2021-01-06 19:30:40,178 INFO L226 Difference]: Without dead ends: 2822 [2021-01-06 19:30:40,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2021-01-06 19:30:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 1946. [2021-01-06 19:30:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:40,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2889 transitions. [2021-01-06 19:30:40,354 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2889 transitions. Word has length 133 [2021-01-06 19:30:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:40,355 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2889 transitions. [2021-01-06 19:30:40,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2889 transitions. [2021-01-06 19:30:40,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:40,357 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:40,357 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] [2021-01-06 19:30:40,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:30:40,358 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1782648988, now seen corresponding path program 1 times [2021-01-06 19:30:40,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:40,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275089422] [2021-01-06 19:30:40,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:30:40,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275089422] [2021-01-06 19:30:40,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:40,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:40,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530996166] [2021-01-06 19:30:40,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:40,469 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:40,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:40,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:40,470 INFO L87 Difference]: Start difference. First operand 1946 states and 2889 transitions. Second operand 4 states. [2021-01-06 19:30:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:40,732 INFO L93 Difference]: Finished difference Result 4750 states and 7038 transitions. [2021-01-06 19:30:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:40,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:40,749 INFO L225 Difference]: With dead ends: 4750 [2021-01-06 19:30:40,749 INFO L226 Difference]: Without dead ends: 2821 [2021-01-06 19:30:40,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2821 states. [2021-01-06 19:30:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2821 to 1946. [2021-01-06 19:30:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:40,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2886 transitions. [2021-01-06 19:30:40,935 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2886 transitions. Word has length 133 [2021-01-06 19:30:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:40,936 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2886 transitions. [2021-01-06 19:30:40,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2886 transitions. [2021-01-06 19:30:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:40,938 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:40,938 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] [2021-01-06 19:30:40,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:30:40,939 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:40,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:40,944 INFO L82 PathProgramCache]: Analyzing trace with hash 60646302, now seen corresponding path program 1 times [2021-01-06 19:30:40,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:40,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111990647] [2021-01-06 19:30:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:41,011 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:30:41,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111990647] [2021-01-06 19:30:41,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:41,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:41,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533742740] [2021-01-06 19:30:41,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:41,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:41,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:41,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:41,015 INFO L87 Difference]: Start difference. First operand 1946 states and 2886 transitions. Second operand 3 states. [2021-01-06 19:30:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:41,141 INFO L93 Difference]: Finished difference Result 3874 states and 5745 transitions. [2021-01-06 19:30:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:41,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2021-01-06 19:30:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:41,152 INFO L225 Difference]: With dead ends: 3874 [2021-01-06 19:30:41,152 INFO L226 Difference]: Without dead ends: 1946 [2021-01-06 19:30:41,158 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:30:41,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2021-01-06 19:30:41,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2021-01-06 19:30:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2878 transitions. [2021-01-06 19:30:41,275 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2878 transitions. Word has length 133 [2021-01-06 19:30:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:41,276 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2878 transitions. [2021-01-06 19:30:41,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2878 transitions. [2021-01-06 19:30:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:41,277 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:41,278 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] [2021-01-06 19:30:41,278 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:30:41,278 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:41,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:41,279 INFO L82 PathProgramCache]: Analyzing trace with hash 387534686, now seen corresponding path program 1 times [2021-01-06 19:30:41,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:41,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5142716] [2021-01-06 19:30:41,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:41,338 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:30:41,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5142716] [2021-01-06 19:30:41,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:41,339 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:41,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386200511] [2021-01-06 19:30:41,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:41,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:41,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:41,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:41,341 INFO L87 Difference]: Start difference. First operand 1946 states and 2878 transitions. Second operand 3 states. [2021-01-06 19:30:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:41,499 INFO L93 Difference]: Finished difference Result 3873 states and 5728 transitions. [2021-01-06 19:30:41,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:41,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2021-01-06 19:30:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:41,511 INFO L225 Difference]: With dead ends: 3873 [2021-01-06 19:30:41,512 INFO L226 Difference]: Without dead ends: 1946 [2021-01-06 19:30:41,516 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:30:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2021-01-06 19:30:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2021-01-06 19:30:41,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2870 transitions. [2021-01-06 19:30:41,650 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2870 transitions. Word has length 133 [2021-01-06 19:30:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:41,650 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2870 transitions. [2021-01-06 19:30:41,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2870 transitions. [2021-01-06 19:30:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:41,652 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:41,652 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] [2021-01-06 19:30:41,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:30:41,653 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:41,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1922100126, now seen corresponding path program 1 times [2021-01-06 19:30:41,654 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:41,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873189837] [2021-01-06 19:30:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:41,707 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:30:41,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873189837] [2021-01-06 19:30:41,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:41,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:41,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680135553] [2021-01-06 19:30:41,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:41,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:41,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:41,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:41,716 INFO L87 Difference]: Start difference. First operand 1946 states and 2870 transitions. Second operand 4 states. [2021-01-06 19:30:41,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:41,999 INFO L93 Difference]: Finished difference Result 4744 states and 6986 transitions. [2021-01-06 19:30:41,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:41,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:42,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:42,015 INFO L225 Difference]: With dead ends: 4744 [2021-01-06 19:30:42,015 INFO L226 Difference]: Without dead ends: 2818 [2021-01-06 19:30:42,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2021-01-06 19:30:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 1946. [2021-01-06 19:30:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2867 transitions. [2021-01-06 19:30:42,208 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2867 transitions. Word has length 133 [2021-01-06 19:30:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:42,210 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2867 transitions. [2021-01-06 19:30:42,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2867 transitions. [2021-01-06 19:30:42,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:42,212 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:42,213 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:42,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:30:42,213 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:42,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash -370980900, now seen corresponding path program 1 times [2021-01-06 19:30:42,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:42,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862850963] [2021-01-06 19:30:42,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:42,285 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:30:42,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862850963] [2021-01-06 19:30:42,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:42,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:42,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604214894] [2021-01-06 19:30:42,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:42,287 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:42,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:42,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:42,288 INFO L87 Difference]: Start difference. First operand 1946 states and 2867 transitions. Second operand 3 states. [2021-01-06 19:30:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:42,413 INFO L93 Difference]: Finished difference Result 3870 states and 5702 transitions. [2021-01-06 19:30:42,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:42,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2021-01-06 19:30:42,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:42,426 INFO L225 Difference]: With dead ends: 3870 [2021-01-06 19:30:42,426 INFO L226 Difference]: Without dead ends: 1946 [2021-01-06 19:30:42,430 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:30:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2021-01-06 19:30:42,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2021-01-06 19:30:42,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2859 transitions. [2021-01-06 19:30:42,550 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2859 transitions. Word has length 133 [2021-01-06 19:30:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:42,551 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2859 transitions. [2021-01-06 19:30:42,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2859 transitions. [2021-01-06 19:30:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:42,553 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:42,553 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] [2021-01-06 19:30:42,553 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:30:42,554 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:42,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash 100375450, now seen corresponding path program 1 times [2021-01-06 19:30:42,555 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:42,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689062602] [2021-01-06 19:30:42,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:42,654 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:30:42,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689062602] [2021-01-06 19:30:42,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:42,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:42,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833829476] [2021-01-06 19:30:42,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:42,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:42,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:42,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:42,658 INFO L87 Difference]: Start difference. First operand 1946 states and 2859 transitions. Second operand 3 states. [2021-01-06 19:30:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:42,814 INFO L93 Difference]: Finished difference Result 3869 states and 5685 transitions. [2021-01-06 19:30:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:42,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2021-01-06 19:30:42,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:42,825 INFO L225 Difference]: With dead ends: 3869 [2021-01-06 19:30:42,825 INFO L226 Difference]: Without dead ends: 1946 [2021-01-06 19:30:42,830 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:30:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2021-01-06 19:30:42,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2021-01-06 19:30:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:42,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2851 transitions. [2021-01-06 19:30:42,974 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2851 transitions. Word has length 133 [2021-01-06 19:30:42,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:42,975 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2851 transitions. [2021-01-06 19:30:42,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2851 transitions. [2021-01-06 19:30:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:42,977 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:42,977 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] [2021-01-06 19:30:42,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:30:42,978 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:42,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:42,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1272227878, now seen corresponding path program 1 times [2021-01-06 19:30:42,978 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:42,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212992312] [2021-01-06 19:30:42,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:43,028 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:30:43,028 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212992312] [2021-01-06 19:30:43,028 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:43,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:43,029 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31230635] [2021-01-06 19:30:43,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:43,029 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:43,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:43,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:43,030 INFO L87 Difference]: Start difference. First operand 1946 states and 2851 transitions. Second operand 4 states. [2021-01-06 19:30:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:43,330 INFO L93 Difference]: Finished difference Result 4666 states and 6831 transitions. [2021-01-06 19:30:43,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:43,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:43,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:43,362 INFO L225 Difference]: With dead ends: 4666 [2021-01-06 19:30:43,362 INFO L226 Difference]: Without dead ends: 2744 [2021-01-06 19:30:43,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2744 states. [2021-01-06 19:30:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2744 to 1946. [2021-01-06 19:30:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2848 transitions. [2021-01-06 19:30:43,485 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2848 transitions. Word has length 133 [2021-01-06 19:30:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:43,485 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2848 transitions. [2021-01-06 19:30:43,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2848 transitions. [2021-01-06 19:30:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:43,487 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:43,488 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] [2021-01-06 19:30:43,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:30:43,488 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:43,489 INFO L82 PathProgramCache]: Analyzing trace with hash 891388696, now seen corresponding path program 1 times [2021-01-06 19:30:43,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:43,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020789355] [2021-01-06 19:30:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:43,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:30:43,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020789355] [2021-01-06 19:30:43,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:43,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:43,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494335438] [2021-01-06 19:30:43,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:43,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:43,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:43,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:43,546 INFO L87 Difference]: Start difference. First operand 1946 states and 2848 transitions. Second operand 3 states. [2021-01-06 19:30:43,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:43,691 INFO L93 Difference]: Finished difference Result 3867 states and 5661 transitions. [2021-01-06 19:30:43,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:43,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2021-01-06 19:30:43,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:43,698 INFO L225 Difference]: With dead ends: 3867 [2021-01-06 19:30:43,699 INFO L226 Difference]: Without dead ends: 1946 [2021-01-06 19:30:43,702 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:30:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2021-01-06 19:30:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2021-01-06 19:30:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2820 transitions. [2021-01-06 19:30:43,836 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2820 transitions. Word has length 133 [2021-01-06 19:30:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:43,836 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2820 transitions. [2021-01-06 19:30:43,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2820 transitions. [2021-01-06 19:30:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:43,838 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:43,839 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] [2021-01-06 19:30:43,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:30:43,839 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:43,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:43,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1077630711, now seen corresponding path program 1 times [2021-01-06 19:30:43,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:43,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732359456] [2021-01-06 19:30:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:43,899 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:30:43,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732359456] [2021-01-06 19:30:43,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:43,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:43,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057847388] [2021-01-06 19:30:43,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:43,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:43,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:43,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:43,901 INFO L87 Difference]: Start difference. First operand 1946 states and 2820 transitions. Second operand 4 states. [2021-01-06 19:30:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:44,231 INFO L93 Difference]: Finished difference Result 4662 states and 6752 transitions. [2021-01-06 19:30:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:44,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:44,245 INFO L225 Difference]: With dead ends: 4662 [2021-01-06 19:30:44,246 INFO L226 Difference]: Without dead ends: 2742 [2021-01-06 19:30:44,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2742 states. [2021-01-06 19:30:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2742 to 1946. [2021-01-06 19:30:44,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2817 transitions. [2021-01-06 19:30:44,392 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2817 transitions. Word has length 133 [2021-01-06 19:30:44,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:44,394 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2817 transitions. [2021-01-06 19:30:44,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:44,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2817 transitions. [2021-01-06 19:30:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:44,397 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:44,397 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] [2021-01-06 19:30:44,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:30:44,398 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash -895534667, now seen corresponding path program 1 times [2021-01-06 19:30:44,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:44,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676602559] [2021-01-06 19:30:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:44,471 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:30:44,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676602559] [2021-01-06 19:30:44,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:44,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:44,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387675097] [2021-01-06 19:30:44,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:44,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:44,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:44,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:44,474 INFO L87 Difference]: Start difference. First operand 1946 states and 2817 transitions. Second operand 3 states. [2021-01-06 19:30:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:44,639 INFO L93 Difference]: Finished difference Result 3865 states and 5597 transitions. [2021-01-06 19:30:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:44,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2021-01-06 19:30:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:44,644 INFO L225 Difference]: With dead ends: 3865 [2021-01-06 19:30:44,644 INFO L226 Difference]: Without dead ends: 1946 [2021-01-06 19:30:44,648 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:30:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2021-01-06 19:30:44,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1946. [2021-01-06 19:30:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2789 transitions. [2021-01-06 19:30:44,795 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2789 transitions. Word has length 133 [2021-01-06 19:30:44,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:44,795 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2789 transitions. [2021-01-06 19:30:44,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:44,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2789 transitions. [2021-01-06 19:30:44,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:44,797 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:44,798 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] [2021-01-06 19:30:44,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:30:44,798 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:44,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:44,799 INFO L82 PathProgramCache]: Analyzing trace with hash 827216916, now seen corresponding path program 1 times [2021-01-06 19:30:44,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:44,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880633358] [2021-01-06 19:30:44,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:44,845 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:30:44,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880633358] [2021-01-06 19:30:44,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:44,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:44,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239140769] [2021-01-06 19:30:44,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:44,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:44,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:44,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:44,848 INFO L87 Difference]: Start difference. First operand 1946 states and 2789 transitions. Second operand 4 states. [2021-01-06 19:30:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:45,168 INFO L93 Difference]: Finished difference Result 4658 states and 6673 transitions. [2021-01-06 19:30:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:45,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:45,175 INFO L225 Difference]: With dead ends: 4658 [2021-01-06 19:30:45,175 INFO L226 Difference]: Without dead ends: 2740 [2021-01-06 19:30:45,179 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2740 states. [2021-01-06 19:30:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2740 to 1946. [2021-01-06 19:30:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2786 transitions. [2021-01-06 19:30:45,382 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2786 transitions. Word has length 133 [2021-01-06 19:30:45,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:45,383 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2786 transitions. [2021-01-06 19:30:45,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:45,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2786 transitions. [2021-01-06 19:30:45,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:45,385 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:45,385 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] [2021-01-06 19:30:45,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:30:45,386 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:45,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:45,387 INFO L82 PathProgramCache]: Analyzing trace with hash 203935314, now seen corresponding path program 1 times [2021-01-06 19:30:45,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:45,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896794075] [2021-01-06 19:30:45,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:45,450 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:30:45,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896794075] [2021-01-06 19:30:45,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:45,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:45,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958920762] [2021-01-06 19:30:45,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:45,452 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:45,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:45,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:45,453 INFO L87 Difference]: Start difference. First operand 1946 states and 2786 transitions. Second operand 4 states. [2021-01-06 19:30:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:45,841 INFO L93 Difference]: Finished difference Result 4654 states and 6659 transitions. [2021-01-06 19:30:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:45,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:45,850 INFO L225 Difference]: With dead ends: 4654 [2021-01-06 19:30:45,850 INFO L226 Difference]: Without dead ends: 2738 [2021-01-06 19:30:45,854 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2021-01-06 19:30:45,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 1946. [2021-01-06 19:30:45,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:46,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2783 transitions. [2021-01-06 19:30:46,002 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2783 transitions. Word has length 133 [2021-01-06 19:30:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:46,002 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2783 transitions. [2021-01-06 19:30:46,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2783 transitions. [2021-01-06 19:30:46,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:46,004 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:46,004 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] [2021-01-06 19:30:46,004 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:30:46,005 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:46,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:46,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1593229328, now seen corresponding path program 1 times [2021-01-06 19:30:46,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:46,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027048346] [2021-01-06 19:30:46,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:46,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:46,055 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:30:46,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027048346] [2021-01-06 19:30:46,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:46,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:46,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25427299] [2021-01-06 19:30:46,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:46,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:46,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:46,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:46,058 INFO L87 Difference]: Start difference. First operand 1946 states and 2783 transitions. Second operand 4 states. [2021-01-06 19:30:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:46,398 INFO L93 Difference]: Finished difference Result 4652 states and 6649 transitions. [2021-01-06 19:30:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:46,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:46,405 INFO L225 Difference]: With dead ends: 4652 [2021-01-06 19:30:46,405 INFO L226 Difference]: Without dead ends: 2737 [2021-01-06 19:30:46,408 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2021-01-06 19:30:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 1946. [2021-01-06 19:30:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2780 transitions. [2021-01-06 19:30:46,544 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2780 transitions. Word has length 133 [2021-01-06 19:30:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:46,545 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2780 transitions. [2021-01-06 19:30:46,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2780 transitions. [2021-01-06 19:30:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:46,546 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:46,547 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] [2021-01-06 19:30:46,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:30:46,547 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:46,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:46,548 INFO L82 PathProgramCache]: Analyzing trace with hash -440164718, now seen corresponding path program 1 times [2021-01-06 19:30:46,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:46,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340671780] [2021-01-06 19:30:46,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:46,618 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:30:46,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340671780] [2021-01-06 19:30:46,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:46,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:46,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20705382] [2021-01-06 19:30:46,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:46,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:46,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:46,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:46,622 INFO L87 Difference]: Start difference. First operand 1946 states and 2780 transitions. Second operand 4 states. [2021-01-06 19:30:46,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:46,999 INFO L93 Difference]: Finished difference Result 4650 states and 6639 transitions. [2021-01-06 19:30:47,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:47,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:47,006 INFO L225 Difference]: With dead ends: 4650 [2021-01-06 19:30:47,007 INFO L226 Difference]: Without dead ends: 2736 [2021-01-06 19:30:47,009 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:47,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2736 states. [2021-01-06 19:30:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2736 to 1946. [2021-01-06 19:30:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1946 states. [2021-01-06 19:30:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1946 states to 1946 states and 2777 transitions. [2021-01-06 19:30:47,151 INFO L78 Accepts]: Start accepts. Automaton has 1946 states and 2777 transitions. Word has length 133 [2021-01-06 19:30:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:47,152 INFO L481 AbstractCegarLoop]: Abstraction has 1946 states and 2777 transitions. [2021-01-06 19:30:47,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1946 states and 2777 transitions. [2021-01-06 19:30:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:47,154 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:47,154 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] [2021-01-06 19:30:47,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:30:47,154 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:47,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:47,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1988093904, now seen corresponding path program 1 times [2021-01-06 19:30:47,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:47,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303595634] [2021-01-06 19:30:47,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:47,209 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:30:47,209 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303595634] [2021-01-06 19:30:47,209 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:47,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:47,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160685060] [2021-01-06 19:30:47,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:47,210 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:47,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:47,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:47,211 INFO L87 Difference]: Start difference. First operand 1946 states and 2777 transitions. Second operand 5 states. [2021-01-06 19:30:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:47,687 INFO L93 Difference]: Finished difference Result 6004 states and 8619 transitions. [2021-01-06 19:30:47,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:47,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2021-01-06 19:30:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:47,697 INFO L225 Difference]: With dead ends: 6004 [2021-01-06 19:30:47,698 INFO L226 Difference]: Without dead ends: 4097 [2021-01-06 19:30:47,702 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:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2021-01-06 19:30:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 1979. [2021-01-06 19:30:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1979 states. [2021-01-06 19:30:47,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1979 states to 1979 states and 2799 transitions. [2021-01-06 19:30:47,900 INFO L78 Accepts]: Start accepts. Automaton has 1979 states and 2799 transitions. Word has length 133 [2021-01-06 19:30:47,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:47,900 INFO L481 AbstractCegarLoop]: Abstraction has 1979 states and 2799 transitions. [2021-01-06 19:30:47,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1979 states and 2799 transitions. [2021-01-06 19:30:47,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:47,902 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:47,902 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] [2021-01-06 19:30:47,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:30:47,902 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:47,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:47,903 INFO L82 PathProgramCache]: Analyzing trace with hash 931362702, now seen corresponding path program 1 times [2021-01-06 19:30:47,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:47,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741988678] [2021-01-06 19:30:47,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:47,952 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:30:47,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741988678] [2021-01-06 19:30:47,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:47,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:47,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172991141] [2021-01-06 19:30:47,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:47,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:47,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:47,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:47,955 INFO L87 Difference]: Start difference. First operand 1979 states and 2799 transitions. Second operand 4 states. [2021-01-06 19:30:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:48,671 INFO L93 Difference]: Finished difference Result 7383 states and 10433 transitions. [2021-01-06 19:30:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:48,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:30:48,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:48,685 INFO L225 Difference]: With dead ends: 7383 [2021-01-06 19:30:48,685 INFO L226 Difference]: Without dead ends: 5438 [2021-01-06 19:30:48,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5438 states. [2021-01-06 19:30:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5438 to 5162. [2021-01-06 19:30:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5162 states. [2021-01-06 19:30:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5162 states to 5162 states and 7244 transitions. [2021-01-06 19:30:49,168 INFO L78 Accepts]: Start accepts. Automaton has 5162 states and 7244 transitions. Word has length 133 [2021-01-06 19:30:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:49,168 INFO L481 AbstractCegarLoop]: Abstraction has 5162 states and 7244 transitions. [2021-01-06 19:30:49,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5162 states and 7244 transitions. [2021-01-06 19:30:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:49,170 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:49,171 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] [2021-01-06 19:30:49,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:30:49,172 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:49,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1204358125, now seen corresponding path program 1 times [2021-01-06 19:30:49,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:49,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148647087] [2021-01-06 19:30:49,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:49,243 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:30:49,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148647087] [2021-01-06 19:30:49,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:49,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:49,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458960414] [2021-01-06 19:30:49,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:49,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:49,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:49,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:49,246 INFO L87 Difference]: Start difference. First operand 5162 states and 7244 transitions. Second operand 5 states. [2021-01-06 19:30:50,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:50,175 INFO L93 Difference]: Finished difference Result 13627 states and 19176 transitions. [2021-01-06 19:30:50,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:50,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2021-01-06 19:30:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:50,201 INFO L225 Difference]: With dead ends: 13627 [2021-01-06 19:30:50,201 INFO L226 Difference]: Without dead ends: 8509 [2021-01-06 19:30:50,211 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:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8509 states. [2021-01-06 19:30:50,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8509 to 5225. [2021-01-06 19:30:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5225 states. [2021-01-06 19:30:50,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5225 states to 5225 states and 7270 transitions. [2021-01-06 19:30:50,753 INFO L78 Accepts]: Start accepts. Automaton has 5225 states and 7270 transitions. Word has length 133 [2021-01-06 19:30:50,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:50,754 INFO L481 AbstractCegarLoop]: Abstraction has 5225 states and 7270 transitions. [2021-01-06 19:30:50,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5225 states and 7270 transitions. [2021-01-06 19:30:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:50,756 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:50,756 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] [2021-01-06 19:30:50,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:30:50,757 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:50,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:50,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1213545941, now seen corresponding path program 1 times [2021-01-06 19:30:50,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:50,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484412514] [2021-01-06 19:30:50,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:50,804 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:30:50,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484412514] [2021-01-06 19:30:50,805 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:50,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:50,806 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357416742] [2021-01-06 19:30:50,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:50,806 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:50,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:50,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:50,807 INFO L87 Difference]: Start difference. First operand 5225 states and 7270 transitions. Second operand 5 states. [2021-01-06 19:30:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:51,486 INFO L93 Difference]: Finished difference Result 11497 states and 15969 transitions. [2021-01-06 19:30:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:51,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2021-01-06 19:30:51,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:51,501 INFO L225 Difference]: With dead ends: 11497 [2021-01-06 19:30:51,501 INFO L226 Difference]: Without dead ends: 6323 [2021-01-06 19:30:51,510 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:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6323 states. [2021-01-06 19:30:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6323 to 5231. [2021-01-06 19:30:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5231 states. [2021-01-06 19:30:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5231 states to 5231 states and 7220 transitions. [2021-01-06 19:30:52,007 INFO L78 Accepts]: Start accepts. Automaton has 5231 states and 7220 transitions. Word has length 133 [2021-01-06 19:30:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:52,008 INFO L481 AbstractCegarLoop]: Abstraction has 5231 states and 7220 transitions. [2021-01-06 19:30:52,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 5231 states and 7220 transitions. [2021-01-06 19:30:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:52,010 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:52,010 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] [2021-01-06 19:30:52,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:30:52,011 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1202290409, now seen corresponding path program 1 times [2021-01-06 19:30:52,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:52,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524543447] [2021-01-06 19:30:52,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:52,075 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:30:52,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524543447] [2021-01-06 19:30:52,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:52,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:52,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553377929] [2021-01-06 19:30:52,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:52,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:52,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:52,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:52,078 INFO L87 Difference]: Start difference. First operand 5231 states and 7220 transitions. Second operand 5 states. [2021-01-06 19:30:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:52,951 INFO L93 Difference]: Finished difference Result 13682 states and 18810 transitions. [2021-01-06 19:30:52,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:52,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2021-01-06 19:30:52,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:53,024 INFO L225 Difference]: With dead ends: 13682 [2021-01-06 19:30:53,024 INFO L226 Difference]: Without dead ends: 8516 [2021-01-06 19:30:53,031 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:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8516 states. [2021-01-06 19:30:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8516 to 5249. [2021-01-06 19:30:53,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5249 states. [2021-01-06 19:30:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5249 states to 5249 states and 7186 transitions. [2021-01-06 19:30:53,411 INFO L78 Accepts]: Start accepts. Automaton has 5249 states and 7186 transitions. Word has length 133 [2021-01-06 19:30:53,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:53,412 INFO L481 AbstractCegarLoop]: Abstraction has 5249 states and 7186 transitions. [2021-01-06 19:30:53,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:53,412 INFO L276 IsEmpty]: Start isEmpty. Operand 5249 states and 7186 transitions. [2021-01-06 19:30:53,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:53,414 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:53,414 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] [2021-01-06 19:30:53,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:30:53,414 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1279191207, now seen corresponding path program 1 times [2021-01-06 19:30:53,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:53,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518967662] [2021-01-06 19:30:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:30:53,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518967662] [2021-01-06 19:30:53,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:53,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:53,481 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394761855] [2021-01-06 19:30:53,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:53,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:53,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:53,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:53,482 INFO L87 Difference]: Start difference. First operand 5249 states and 7186 transitions. Second operand 5 states. [2021-01-06 19:30:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:54,500 INFO L93 Difference]: Finished difference Result 18176 states and 25140 transitions. [2021-01-06 19:30:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:54,500 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2021-01-06 19:30:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:54,524 INFO L225 Difference]: With dead ends: 18176 [2021-01-06 19:30:54,524 INFO L226 Difference]: Without dead ends: 12999 [2021-01-06 19:30:54,537 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:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12999 states. [2021-01-06 19:30:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12999 to 5423. [2021-01-06 19:30:55,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5423 states. [2021-01-06 19:30:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5423 states to 5423 states and 7360 transitions. [2021-01-06 19:30:55,495 INFO L78 Accepts]: Start accepts. Automaton has 5423 states and 7360 transitions. Word has length 133 [2021-01-06 19:30:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:55,496 INFO L481 AbstractCegarLoop]: Abstraction has 5423 states and 7360 transitions. [2021-01-06 19:30:55,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:55,496 INFO L276 IsEmpty]: Start isEmpty. Operand 5423 states and 7360 transitions. [2021-01-06 19:30:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:55,498 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:55,498 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] [2021-01-06 19:30:55,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:30:55,499 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:55,500 INFO L82 PathProgramCache]: Analyzing trace with hash 547223781, now seen corresponding path program 1 times [2021-01-06 19:30:55,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:55,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080860440] [2021-01-06 19:30:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:55,603 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:30:55,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080860440] [2021-01-06 19:30:55,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:55,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:55,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124935437] [2021-01-06 19:30:55,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:55,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:55,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:55,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:55,607 INFO L87 Difference]: Start difference. First operand 5423 states and 7360 transitions. Second operand 3 states. [2021-01-06 19:30:56,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:56,697 INFO L93 Difference]: Finished difference Result 15568 states and 21132 transitions. [2021-01-06 19:30:56,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:56,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2021-01-06 19:30:56,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:56,714 INFO L225 Difference]: With dead ends: 15568 [2021-01-06 19:30:56,715 INFO L226 Difference]: Without dead ends: 10222 [2021-01-06 19:30:56,724 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:30:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10222 states. [2021-01-06 19:30:58,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10222 to 10208. [2021-01-06 19:30:58,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10208 states. [2021-01-06 19:30:58,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10208 states to 10208 states and 13797 transitions. [2021-01-06 19:30:58,026 INFO L78 Accepts]: Start accepts. Automaton has 10208 states and 13797 transitions. Word has length 133 [2021-01-06 19:30:58,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:58,027 INFO L481 AbstractCegarLoop]: Abstraction has 10208 states and 13797 transitions. [2021-01-06 19:30:58,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:58,027 INFO L276 IsEmpty]: Start isEmpty. Operand 10208 states and 13797 transitions. [2021-01-06 19:30:58,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:30:58,028 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:58,028 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] [2021-01-06 19:30:58,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:30:58,028 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:58,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1252142468, now seen corresponding path program 1 times [2021-01-06 19:30:58,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:58,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175847127] [2021-01-06 19:30:58,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:58,078 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:30:58,078 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175847127] [2021-01-06 19:30:58,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:58,079 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:58,079 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327749590] [2021-01-06 19:30:58,079 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:58,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:58,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:58,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:58,080 INFO L87 Difference]: Start difference. First operand 10208 states and 13797 transitions. Second operand 5 states. [2021-01-06 19:30:59,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:59,576 INFO L93 Difference]: Finished difference Result 27760 states and 37807 transitions. [2021-01-06 19:30:59,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:59,576 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2021-01-06 19:30:59,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:59,595 INFO L225 Difference]: With dead ends: 27760 [2021-01-06 19:30:59,595 INFO L226 Difference]: Without dead ends: 17633 [2021-01-06 19:30:59,609 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:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17633 states. [2021-01-06 19:31:00,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17633 to 10379. [2021-01-06 19:31:00,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10379 states. [2021-01-06 19:31:00,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10379 states to 10379 states and 13916 transitions. [2021-01-06 19:31:00,625 INFO L78 Accepts]: Start accepts. Automaton has 10379 states and 13916 transitions. Word has length 133 [2021-01-06 19:31:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:00,625 INFO L481 AbstractCegarLoop]: Abstraction has 10379 states and 13916 transitions. [2021-01-06 19:31:00,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:31:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 13916 transitions. [2021-01-06 19:31:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:31:00,628 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:00,628 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] [2021-01-06 19:31:00,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:31:00,628 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:00,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:00,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1453966402, now seen corresponding path program 1 times [2021-01-06 19:31:00,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:00,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261984669] [2021-01-06 19:31:00,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:00,687 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:31:00,687 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261984669] [2021-01-06 19:31:00,687 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:00,687 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:31:00,687 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917041353] [2021-01-06 19:31:00,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:31:00,688 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:00,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:31:00,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:00,689 INFO L87 Difference]: Start difference. First operand 10379 states and 13916 transitions. Second operand 5 states. [2021-01-06 19:31:02,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:02,992 INFO L93 Difference]: Finished difference Result 34355 states and 46558 transitions. [2021-01-06 19:31:02,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:02,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2021-01-06 19:31:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:03,024 INFO L225 Difference]: With dead ends: 34355 [2021-01-06 19:31:03,025 INFO L226 Difference]: Without dead ends: 24064 [2021-01-06 19:31:03,040 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:31:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24064 states. [2021-01-06 19:31:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24064 to 10706. [2021-01-06 19:31:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10706 states. [2021-01-06 19:31:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10706 states to 10706 states and 14243 transitions. [2021-01-06 19:31:04,194 INFO L78 Accepts]: Start accepts. Automaton has 10706 states and 14243 transitions. Word has length 133 [2021-01-06 19:31:04,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:04,195 INFO L481 AbstractCegarLoop]: Abstraction has 10706 states and 14243 transitions. [2021-01-06 19:31:04,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:31:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 10706 states and 14243 transitions. [2021-01-06 19:31:04,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:31:04,196 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:04,196 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] [2021-01-06 19:31:04,196 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:31:04,197 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:04,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1964981888, now seen corresponding path program 1 times [2021-01-06 19:31:04,197 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:04,198 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275019526] [2021-01-06 19:31:04,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:04,259 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:31:04,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275019526] [2021-01-06 19:31:04,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:04,259 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:04,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050554930] [2021-01-06 19:31:04,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:04,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:04,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:04,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:04,261 INFO L87 Difference]: Start difference. First operand 10706 states and 14243 transitions. Second operand 4 states. [2021-01-06 19:31:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:06,833 INFO L93 Difference]: Finished difference Result 40362 states and 53693 transitions. [2021-01-06 19:31:06,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:06,834 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:31:06,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:06,869 INFO L225 Difference]: With dead ends: 40362 [2021-01-06 19:31:06,869 INFO L226 Difference]: Without dead ends: 29749 [2021-01-06 19:31:06,884 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:31:06,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29749 states. [2021-01-06 19:31:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29749 to 28873. [2021-01-06 19:31:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28873 states. [2021-01-06 19:31:09,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28873 states to 28873 states and 38186 transitions. [2021-01-06 19:31:09,778 INFO L78 Accepts]: Start accepts. Automaton has 28873 states and 38186 transitions. Word has length 133 [2021-01-06 19:31:09,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:09,778 INFO L481 AbstractCegarLoop]: Abstraction has 28873 states and 38186 transitions. [2021-01-06 19:31:09,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 28873 states and 38186 transitions. [2021-01-06 19:31:09,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:31:09,779 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:09,779 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] [2021-01-06 19:31:09,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:31:09,780 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1628417183, now seen corresponding path program 1 times [2021-01-06 19:31:09,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:09,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915870964] [2021-01-06 19:31:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:31:09,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915870964] [2021-01-06 19:31:09,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:09,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:31:09,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409130777] [2021-01-06 19:31:09,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:31:09,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:09,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:31:09,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:09,842 INFO L87 Difference]: Start difference. First operand 28873 states and 38186 transitions. Second operand 5 states. [2021-01-06 19:31:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:13,960 INFO L93 Difference]: Finished difference Result 70833 states and 94226 transitions. [2021-01-06 19:31:13,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:13,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2021-01-06 19:31:13,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:14,010 INFO L225 Difference]: With dead ends: 70833 [2021-01-06 19:31:14,010 INFO L226 Difference]: Without dead ends: 42057 [2021-01-06 19:31:14,042 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:31:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42057 states. [2021-01-06 19:31:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42057 to 29197. [2021-01-06 19:31:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29197 states. [2021-01-06 19:31:17,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29197 states to 29197 states and 38325 transitions. [2021-01-06 19:31:17,467 INFO L78 Accepts]: Start accepts. Automaton has 29197 states and 38325 transitions. Word has length 133 [2021-01-06 19:31:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:17,468 INFO L481 AbstractCegarLoop]: Abstraction has 29197 states and 38325 transitions. [2021-01-06 19:31:17,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:31:17,468 INFO L276 IsEmpty]: Start isEmpty. Operand 29197 states and 38325 transitions. [2021-01-06 19:31:17,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-01-06 19:31:17,469 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:17,469 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] [2021-01-06 19:31:17,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:31:17,469 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:17,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:17,470 INFO L82 PathProgramCache]: Analyzing trace with hash -727388067, now seen corresponding path program 1 times [2021-01-06 19:31:17,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:17,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304906759] [2021-01-06 19:31:17,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:17,531 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:31:17,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304906759] [2021-01-06 19:31:17,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:17,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:17,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699194004] [2021-01-06 19:31:17,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:17,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:17,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:17,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:17,533 INFO L87 Difference]: Start difference. First operand 29197 states and 38325 transitions. Second operand 4 states. [2021-01-06 19:31:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:26,223 INFO L93 Difference]: Finished difference Result 115410 states and 151093 transitions. [2021-01-06 19:31:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:26,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2021-01-06 19:31:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:26,335 INFO L225 Difference]: With dead ends: 115410 [2021-01-06 19:31:26,335 INFO L226 Difference]: Without dead ends: 86312 [2021-01-06 19:31:26,375 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:31:26,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86312 states. [2021-01-06 19:31:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86312 to 84800. [2021-01-06 19:31:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84800 states. [2021-01-06 19:31:35,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84800 states to 84800 states and 110236 transitions. [2021-01-06 19:31:35,433 INFO L78 Accepts]: Start accepts. Automaton has 84800 states and 110236 transitions. Word has length 133 [2021-01-06 19:31:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:35,433 INFO L481 AbstractCegarLoop]: Abstraction has 84800 states and 110236 transitions. [2021-01-06 19:31:35,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:35,433 INFO L276 IsEmpty]: Start isEmpty. Operand 84800 states and 110236 transitions. [2021-01-06 19:31:35,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-01-06 19:31:35,439 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:35,440 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:35,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:31:35,440 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:35,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:35,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1994402793, now seen corresponding path program 1 times [2021-01-06 19:31:35,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:35,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578201351] [2021-01-06 19:31:35,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 19:31:35,516 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578201351] [2021-01-06 19:31:35,516 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:35,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:31:35,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151426764] [2021-01-06 19:31:35,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:31:35,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:31:35,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:35,518 INFO L87 Difference]: Start difference. First operand 84800 states and 110236 transitions. Second operand 5 states. [2021-01-06 19:31:48,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:48,122 INFO L93 Difference]: Finished difference Result 204025 states and 266882 transitions. [2021-01-06 19:31:48,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:48,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2021-01-06 19:31:48,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:48,307 INFO L225 Difference]: With dead ends: 204025 [2021-01-06 19:31:48,307 INFO L226 Difference]: Without dead ends: 119328 [2021-01-06 19:31:48,553 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:31:48,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119328 states. [2021-01-06 19:31:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119328 to 85676. [2021-01-06 19:31:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85676 states. [2021-01-06 19:31:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85676 states to 85676 states and 110543 transitions. [2021-01-06 19:31:58,023 INFO L78 Accepts]: Start accepts. Automaton has 85676 states and 110543 transitions. Word has length 153 [2021-01-06 19:31:58,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:58,023 INFO L481 AbstractCegarLoop]: Abstraction has 85676 states and 110543 transitions. [2021-01-06 19:31:58,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:31:58,023 INFO L276 IsEmpty]: Start isEmpty. Operand 85676 states and 110543 transitions. [2021-01-06 19:31:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-01-06 19:31:58,029 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:58,030 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:58,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:31:58,041 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:58,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:58,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1315130539, now seen corresponding path program 1 times [2021-01-06 19:31:58,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:58,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906645689] [2021-01-06 19:31:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 19:31:58,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906645689] [2021-01-06 19:31:58,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:58,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:58,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118838255] [2021-01-06 19:31:58,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:58,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:58,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:58,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:58,119 INFO L87 Difference]: Start difference. First operand 85676 states and 110543 transitions. Second operand 4 states. [2021-01-06 19:32:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:12,320 INFO L93 Difference]: Finished difference Result 210711 states and 271532 transitions. [2021-01-06 19:32:12,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:12,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2021-01-06 19:32:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:12,496 INFO L225 Difference]: With dead ends: 210711 [2021-01-06 19:32:12,496 INFO L226 Difference]: Without dead ends: 125140 [2021-01-06 19:32:12,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:12,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125140 states. [2021-01-06 19:32:22,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125140 to 85676. [2021-01-06 19:32:22,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85676 states. [2021-01-06 19:32:22,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85676 states to 85676 states and 110326 transitions. [2021-01-06 19:32:22,513 INFO L78 Accepts]: Start accepts. Automaton has 85676 states and 110326 transitions. Word has length 153 [2021-01-06 19:32:22,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:22,514 INFO L481 AbstractCegarLoop]: Abstraction has 85676 states and 110326 transitions. [2021-01-06 19:32:22,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:22,514 INFO L276 IsEmpty]: Start isEmpty. Operand 85676 states and 110326 transitions. [2021-01-06 19:32:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2021-01-06 19:32:22,520 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:22,520 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:22,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:32:22,521 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:22,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:22,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1113306605, now seen corresponding path program 1 times [2021-01-06 19:32:22,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:22,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787758827] [2021-01-06 19:32:22,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:22,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-01-06 19:32:22,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787758827] [2021-01-06 19:32:22,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:22,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:22,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892058915] [2021-01-06 19:32:22,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:22,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:22,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:22,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:22,621 INFO L87 Difference]: Start difference. First operand 85676 states and 110326 transitions. Second operand 4 states. [2021-01-06 19:32:37,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:37,183 INFO L93 Difference]: Finished difference Result 210710 states and 271043 transitions. [2021-01-06 19:32:37,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:37,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2021-01-06 19:32:37,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:37,362 INFO L225 Difference]: With dead ends: 210710 [2021-01-06 19:32:37,362 INFO L226 Difference]: Without dead ends: 125140 [2021-01-06 19:32:37,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125140 states.