/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:31:11,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:31:11,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:31:11,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:31:11,923 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:31:11,925 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:31:11,926 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:31:11,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:31:11,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:31:11,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:31:11,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:31:11,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:31:11,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:31:11,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:31:11,939 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:31:11,940 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:31:11,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:31:11,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:31:11,945 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:31:11,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:31:11,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:31:11,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:31:11,956 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:31:11,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:31:11,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:31:11,980 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:31:11,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:31:11,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:31:11,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:31:11,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:31:11,989 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:31:11,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:31:11,992 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:31:11,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:31:11,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:31:11,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:31:11,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:31:11,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:31:11,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:31:11,998 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:31:12,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:31:12,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:31:12,066 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:31:12,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:31:12,071 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:31:12,072 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:31:12,072 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:31:12,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:31:12,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:31:12,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:31:12,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:31:12,074 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:31:12,075 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:31:12,076 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:31:12,076 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:31:12,076 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:31:12,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:31:12,077 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:31:12,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:31:12,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:31:12,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:31:12,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:31:12,079 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:31:12,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:31:12,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:31:12,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:31:12,080 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:31:12,080 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 09:31:12,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:31:12,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:31:12,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:31:12,543 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:31:12,544 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:31:12,549 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2020-12-23 09:31:12,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/82b159d65/e133664e89c748019c63bd5376d6049e/FLAGa715a5812 [2020-12-23 09:31:13,302 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:31:13,303 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2020-12-23 09:31:13,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/82b159d65/e133664e89c748019c63bd5376d6049e/FLAGa715a5812 [2020-12-23 09:31:13,613 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/82b159d65/e133664e89c748019c63bd5376d6049e [2020-12-23 09:31:13,616 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:31:13,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:31:13,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:31:13,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:31:13,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:31:13,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:31:13" (1/1) ... [2020-12-23 09:31:13,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375a81ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:13, skipping insertion in model container [2020-12-23 09:31:13,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:31:13" (1/1) ... [2020-12-23 09:31:13,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:31:13,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:31:13,849 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~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[~__retres1~4,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] 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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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~5,] [2020-12-23 09:31:13,998 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:31:14,017 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:31:14,035 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~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[~__retres1~4,] 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~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] 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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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~5,] [2020-12-23 09:31:14,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:31:14,182 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:31:14,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14 WrapperNode [2020-12-23 09:31:14,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:31:14,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:31:14,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:31:14,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:31:14,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (1/1) ... [2020-12-23 09:31:14,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (1/1) ... [2020-12-23 09:31:14,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:31:14,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:31:14,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:31:14,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:31:14,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (1/1) ... [2020-12-23 09:31:14,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (1/1) ... [2020-12-23 09:31:14,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (1/1) ... [2020-12-23 09:31:14,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (1/1) ... [2020-12-23 09:31:14,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (1/1) ... [2020-12-23 09:31:14,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (1/1) ... [2020-12-23 09:31:14,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (1/1) ... [2020-12-23 09:31:14,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:31:14,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:31:14,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:31:14,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:31:14,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:31:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:31:14,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:31:14,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:31:14,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:31:15,512 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:31:15,513 INFO L299 CfgBuilder]: Removed 132 assume(true) statements. [2020-12-23 09:31:15,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:31:15 BoogieIcfgContainer [2020-12-23 09:31:15,517 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:31:15,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:31:15,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:31:15,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:31:15,529 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:31:13" (1/3) ... [2020-12-23 09:31:15,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e39d2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:31:15, skipping insertion in model container [2020-12-23 09:31:15,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:31:14" (2/3) ... [2020-12-23 09:31:15,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e39d2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:31:15, skipping insertion in model container [2020-12-23 09:31:15,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:31:15" (3/3) ... [2020-12-23 09:31:15,534 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2020-12-23 09:31:15,541 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:31:15,547 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-23 09:31:15,566 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-12-23 09:31:15,618 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:31:15,618 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:31:15,619 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:31:15,619 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:31:15,619 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:31:15,619 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:31:15,619 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:31:15,620 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:31:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states. [2020-12-23 09:31:15,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:15,664 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:15,665 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] [2020-12-23 09:31:15,665 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:15,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:15,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1976596934, now seen corresponding path program 1 times [2020-12-23 09:31:15,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:15,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588427188] [2020-12-23 09:31:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:15,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588427188] [2020-12-23 09:31:15,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:15,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:15,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337801522] [2020-12-23 09:31:15,912 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:15,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:15,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:15,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:15,930 INFO L87 Difference]: Start difference. First operand 316 states. Second operand 3 states. [2020-12-23 09:31:16,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:16,009 INFO L93 Difference]: Finished difference Result 627 states and 979 transitions. [2020-12-23 09:31:16,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:16,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:31:16,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:16,027 INFO L225 Difference]: With dead ends: 627 [2020-12-23 09:31:16,028 INFO L226 Difference]: Without dead ends: 312 [2020-12-23 09:31:16,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-12-23 09:31:16,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2020-12-23 09:31:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2020-12-23 09:31:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 474 transitions. [2020-12-23 09:31:16,121 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 474 transitions. Word has length 61 [2020-12-23 09:31:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:16,122 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 474 transitions. [2020-12-23 09:31:16,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 474 transitions. [2020-12-23 09:31:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:16,124 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:16,125 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] [2020-12-23 09:31:16,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:31:16,125 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:16,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:16,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1057453112, now seen corresponding path program 1 times [2020-12-23 09:31:16,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:16,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576040261] [2020-12-23 09:31:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:16,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:16,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:16,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576040261] [2020-12-23 09:31:16,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:16,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:16,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640161807] [2020-12-23 09:31:16,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:16,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:16,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:16,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:16,257 INFO L87 Difference]: Start difference. First operand 312 states and 474 transitions. Second operand 3 states. [2020-12-23 09:31:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:16,369 INFO L93 Difference]: Finished difference Result 848 states and 1286 transitions. [2020-12-23 09:31:16,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:16,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:31:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:16,381 INFO L225 Difference]: With dead ends: 848 [2020-12-23 09:31:16,382 INFO L226 Difference]: Without dead ends: 544 [2020-12-23 09:31:16,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:16,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2020-12-23 09:31:16,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 540. [2020-12-23 09:31:16,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-23 09:31:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 818 transitions. [2020-12-23 09:31:16,470 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 818 transitions. Word has length 61 [2020-12-23 09:31:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:16,470 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 818 transitions. [2020-12-23 09:31:16,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 818 transitions. [2020-12-23 09:31:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:16,472 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:16,473 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:16,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:31:16,473 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1933472118, now seen corresponding path program 1 times [2020-12-23 09:31:16,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:16,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57729322] [2020-12-23 09:31:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:16,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:16,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57729322] [2020-12-23 09:31:16,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:16,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:16,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680124879] [2020-12-23 09:31:16,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:16,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:16,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:16,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:16,537 INFO L87 Difference]: Start difference. First operand 540 states and 818 transitions. Second operand 4 states. [2020-12-23 09:31:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:16,637 INFO L93 Difference]: Finished difference Result 1302 states and 1969 transitions. [2020-12-23 09:31:16,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:16,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 09:31:16,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:16,642 INFO L225 Difference]: With dead ends: 1302 [2020-12-23 09:31:16,642 INFO L226 Difference]: Without dead ends: 771 [2020-12-23 09:31:16,644 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:16,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2020-12-23 09:31:16,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 540. [2020-12-23 09:31:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-23 09:31:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 815 transitions. [2020-12-23 09:31:16,676 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 815 transitions. Word has length 61 [2020-12-23 09:31:16,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:16,677 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 815 transitions. [2020-12-23 09:31:16,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:16,677 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 815 transitions. [2020-12-23 09:31:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:16,679 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:16,679 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] [2020-12-23 09:31:16,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:31:16,679 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:16,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1917594504, now seen corresponding path program 1 times [2020-12-23 09:31:16,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:16,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112693701] [2020-12-23 09:31:16,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:16,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112693701] [2020-12-23 09:31:16,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:16,771 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:16,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772619164] [2020-12-23 09:31:16,772 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:16,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:16,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:16,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:16,773 INFO L87 Difference]: Start difference. First operand 540 states and 815 transitions. Second operand 4 states. [2020-12-23 09:31:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:16,904 INFO L93 Difference]: Finished difference Result 1300 states and 1959 transitions. [2020-12-23 09:31:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:16,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 09:31:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:16,910 INFO L225 Difference]: With dead ends: 1300 [2020-12-23 09:31:16,910 INFO L226 Difference]: Without dead ends: 770 [2020-12-23 09:31:16,912 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-12-23 09:31:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 540. [2020-12-23 09:31:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-23 09:31:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 812 transitions. [2020-12-23 09:31:16,955 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 812 transitions. Word has length 61 [2020-12-23 09:31:16,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:16,957 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 812 transitions. [2020-12-23 09:31:16,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:16,957 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 812 transitions. [2020-12-23 09:31:16,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:16,960 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:16,960 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] [2020-12-23 09:31:16,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:31:16,961 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:16,962 INFO L82 PathProgramCache]: Analyzing trace with hash -379254474, now seen corresponding path program 1 times [2020-12-23 09:31:16,962 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:16,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524656018] [2020-12-23 09:31:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:17,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524656018] [2020-12-23 09:31:17,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:17,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:17,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638998810] [2020-12-23 09:31:17,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:17,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:17,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:17,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:17,053 INFO L87 Difference]: Start difference. First operand 540 states and 812 transitions. Second operand 3 states. [2020-12-23 09:31:17,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:17,094 INFO L93 Difference]: Finished difference Result 1069 states and 1609 transitions. [2020-12-23 09:31:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:17,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:31:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:17,099 INFO L225 Difference]: With dead ends: 1069 [2020-12-23 09:31:17,099 INFO L226 Difference]: Without dead ends: 540 [2020-12-23 09:31:17,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-23 09:31:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2020-12-23 09:31:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-23 09:31:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 804 transitions. [2020-12-23 09:31:17,131 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 804 transitions. Word has length 61 [2020-12-23 09:31:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:17,131 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 804 transitions. [2020-12-23 09:31:17,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 804 transitions. [2020-12-23 09:31:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:17,133 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:17,133 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] [2020-12-23 09:31:17,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:31:17,133 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash 198182970, now seen corresponding path program 1 times [2020-12-23 09:31:17,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:17,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835771009] [2020-12-23 09:31:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:17,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835771009] [2020-12-23 09:31:17,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:17,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:17,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959622363] [2020-12-23 09:31:17,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:17,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:17,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:17,188 INFO L87 Difference]: Start difference. First operand 540 states and 804 transitions. Second operand 3 states. [2020-12-23 09:31:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:17,250 INFO L93 Difference]: Finished difference Result 1068 states and 1592 transitions. [2020-12-23 09:31:17,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:17,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:31:17,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:17,253 INFO L225 Difference]: With dead ends: 1068 [2020-12-23 09:31:17,254 INFO L226 Difference]: Without dead ends: 540 [2020-12-23 09:31:17,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:17,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-23 09:31:17,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2020-12-23 09:31:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-23 09:31:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 786 transitions. [2020-12-23 09:31:17,286 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 786 transitions. Word has length 61 [2020-12-23 09:31:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:17,286 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 786 transitions. [2020-12-23 09:31:17,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 786 transitions. [2020-12-23 09:31:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:17,288 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:17,288 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] [2020-12-23 09:31:17,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:31:17,288 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1144447607, now seen corresponding path program 1 times [2020-12-23 09:31:17,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:17,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817774740] [2020-12-23 09:31:17,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:17,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817774740] [2020-12-23 09:31:17,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:17,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:17,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925071072] [2020-12-23 09:31:17,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:17,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:17,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:17,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:17,351 INFO L87 Difference]: Start difference. First operand 540 states and 786 transitions. Second operand 3 states. [2020-12-23 09:31:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:17,424 INFO L93 Difference]: Finished difference Result 1066 states and 1553 transitions. [2020-12-23 09:31:17,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:17,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:31:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:17,427 INFO L225 Difference]: With dead ends: 1066 [2020-12-23 09:31:17,428 INFO L226 Difference]: Without dead ends: 540 [2020-12-23 09:31:17,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-23 09:31:17,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2020-12-23 09:31:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-23 09:31:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 768 transitions. [2020-12-23 09:31:17,463 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 768 transitions. Word has length 61 [2020-12-23 09:31:17,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:17,463 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 768 transitions. [2020-12-23 09:31:17,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 768 transitions. [2020-12-23 09:31:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:17,464 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:17,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:17,465 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:31:17,465 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:17,465 INFO L82 PathProgramCache]: Analyzing trace with hash 485983540, now seen corresponding path program 1 times [2020-12-23 09:31:17,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:17,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439516033] [2020-12-23 09:31:17,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:17,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439516033] [2020-12-23 09:31:17,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:17,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:17,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875917099] [2020-12-23 09:31:17,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:17,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:17,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:17,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:17,501 INFO L87 Difference]: Start difference. First operand 540 states and 768 transitions. Second operand 3 states. [2020-12-23 09:31:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:17,561 INFO L93 Difference]: Finished difference Result 1065 states and 1516 transitions. [2020-12-23 09:31:17,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:17,561 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:31:17,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:17,565 INFO L225 Difference]: With dead ends: 1065 [2020-12-23 09:31:17,565 INFO L226 Difference]: Without dead ends: 540 [2020-12-23 09:31:17,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:17,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-12-23 09:31:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2020-12-23 09:31:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2020-12-23 09:31:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 750 transitions. [2020-12-23 09:31:17,600 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 750 transitions. Word has length 61 [2020-12-23 09:31:17,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:17,600 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 750 transitions. [2020-12-23 09:31:17,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 750 transitions. [2020-12-23 09:31:17,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:17,601 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:17,601 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] [2020-12-23 09:31:17,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:31:17,602 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:17,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:17,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1475481145, now seen corresponding path program 1 times [2020-12-23 09:31:17,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:17,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317692144] [2020-12-23 09:31:17,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:17,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317692144] [2020-12-23 09:31:17,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:17,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:31:17,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386390308] [2020-12-23 09:31:17,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:31:17,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:17,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:31:17,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:17,648 INFO L87 Difference]: Start difference. First operand 540 states and 750 transitions. Second operand 5 states. [2020-12-23 09:31:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:17,791 INFO L93 Difference]: Finished difference Result 1372 states and 1926 transitions. [2020-12-23 09:31:17,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:31:17,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 09:31:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:17,796 INFO L225 Difference]: With dead ends: 1372 [2020-12-23 09:31:17,796 INFO L226 Difference]: Without dead ends: 854 [2020-12-23 09:31:17,798 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:31:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2020-12-23 09:31:17,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 546. [2020-12-23 09:31:17,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-12-23 09:31:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 746 transitions. [2020-12-23 09:31:17,856 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 746 transitions. Word has length 61 [2020-12-23 09:31:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:17,856 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 746 transitions. [2020-12-23 09:31:17,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:31:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 746 transitions. [2020-12-23 09:31:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:17,857 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:17,858 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] [2020-12-23 09:31:17,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:31:17,858 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:17,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:17,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1899127867, now seen corresponding path program 1 times [2020-12-23 09:31:17,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:17,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229070069] [2020-12-23 09:31:17,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:17,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229070069] [2020-12-23 09:31:17,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:17,899 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:31:17,899 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366307658] [2020-12-23 09:31:17,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:31:17,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:31:17,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:17,901 INFO L87 Difference]: Start difference. First operand 546 states and 746 transitions. Second operand 5 states. [2020-12-23 09:31:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:18,151 INFO L93 Difference]: Finished difference Result 1918 states and 2625 transitions. [2020-12-23 09:31:18,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:31:18,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 09:31:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:18,159 INFO L225 Difference]: With dead ends: 1918 [2020-12-23 09:31:18,159 INFO L226 Difference]: Without dead ends: 1401 [2020-12-23 09:31:18,161 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:31:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-12-23 09:31:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 582. [2020-12-23 09:31:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2020-12-23 09:31:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 782 transitions. [2020-12-23 09:31:18,218 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 782 transitions. Word has length 61 [2020-12-23 09:31:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:18,218 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 782 transitions. [2020-12-23 09:31:18,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:31:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 782 transitions. [2020-12-23 09:31:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:18,219 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:18,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:18,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:31:18,220 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1055122365, now seen corresponding path program 1 times [2020-12-23 09:31:18,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:18,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583641208] [2020-12-23 09:31:18,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:18,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583641208] [2020-12-23 09:31:18,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:18,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:31:18,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501941142] [2020-12-23 09:31:18,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:31:18,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:18,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:31:18,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:18,270 INFO L87 Difference]: Start difference. First operand 582 states and 782 transitions. Second operand 5 states. [2020-12-23 09:31:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:18,469 INFO L93 Difference]: Finished difference Result 1559 states and 2113 transitions. [2020-12-23 09:31:18,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:31:18,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 09:31:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:18,476 INFO L225 Difference]: With dead ends: 1559 [2020-12-23 09:31:18,477 INFO L226 Difference]: Without dead ends: 1016 [2020-12-23 09:31:18,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:31:18,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2020-12-23 09:31:18,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 588. [2020-12-23 09:31:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2020-12-23 09:31:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 778 transitions. [2020-12-23 09:31:18,537 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 778 transitions. Word has length 61 [2020-12-23 09:31:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:18,539 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 778 transitions. [2020-12-23 09:31:18,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:31:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 778 transitions. [2020-12-23 09:31:18,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:18,540 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:18,540 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] [2020-12-23 09:31:18,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:31:18,541 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:18,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:18,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1853641537, now seen corresponding path program 1 times [2020-12-23 09:31:18,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:18,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161645243] [2020-12-23 09:31:18,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:18,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:18,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161645243] [2020-12-23 09:31:18,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:18,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:31:18,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944025292] [2020-12-23 09:31:18,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:31:18,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:31:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:18,597 INFO L87 Difference]: Start difference. First operand 588 states and 778 transitions. Second operand 5 states. [2020-12-23 09:31:18,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:18,832 INFO L93 Difference]: Finished difference Result 1612 states and 2151 transitions. [2020-12-23 09:31:18,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:31:18,833 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 09:31:18,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:18,839 INFO L225 Difference]: With dead ends: 1612 [2020-12-23 09:31:18,840 INFO L226 Difference]: Without dead ends: 1070 [2020-12-23 09:31:18,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-23 09:31:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2020-12-23 09:31:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 594. [2020-12-23 09:31:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-23 09:31:18,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 774 transitions. [2020-12-23 09:31:18,919 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 774 transitions. Word has length 61 [2020-12-23 09:31:18,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:18,919 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 774 transitions. [2020-12-23 09:31:18,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:31:18,919 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 774 transitions. [2020-12-23 09:31:18,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:18,920 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:18,920 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] [2020-12-23 09:31:18,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:31:18,921 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:18,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:18,921 INFO L82 PathProgramCache]: Analyzing trace with hash 635887425, now seen corresponding path program 1 times [2020-12-23 09:31:18,921 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:18,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031035164] [2020-12-23 09:31:18,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:18,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031035164] [2020-12-23 09:31:18,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:18,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:18,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160373130] [2020-12-23 09:31:18,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:18,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:18,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:18,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:18,986 INFO L87 Difference]: Start difference. First operand 594 states and 774 transitions. Second operand 4 states. [2020-12-23 09:31:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:19,106 INFO L93 Difference]: Finished difference Result 1389 states and 1813 transitions. [2020-12-23 09:31:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:19,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 09:31:19,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:19,112 INFO L225 Difference]: With dead ends: 1389 [2020-12-23 09:31:19,112 INFO L226 Difference]: Without dead ends: 843 [2020-12-23 09:31:19,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2020-12-23 09:31:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 594. [2020-12-23 09:31:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-23 09:31:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 769 transitions. [2020-12-23 09:31:19,173 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 769 transitions. Word has length 61 [2020-12-23 09:31:19,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:19,174 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 769 transitions. [2020-12-23 09:31:19,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:19,174 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 769 transitions. [2020-12-23 09:31:19,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:19,174 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:19,175 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] [2020-12-23 09:31:19,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:31:19,175 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:19,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:19,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1058589251, now seen corresponding path program 1 times [2020-12-23 09:31:19,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:19,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268292241] [2020-12-23 09:31:19,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:19,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268292241] [2020-12-23 09:31:19,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:19,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:19,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120498142] [2020-12-23 09:31:19,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:19,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:19,215 INFO L87 Difference]: Start difference. First operand 594 states and 769 transitions. Second operand 4 states. [2020-12-23 09:31:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:19,351 INFO L93 Difference]: Finished difference Result 1388 states and 1801 transitions. [2020-12-23 09:31:19,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:19,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 09:31:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:19,356 INFO L225 Difference]: With dead ends: 1388 [2020-12-23 09:31:19,356 INFO L226 Difference]: Without dead ends: 843 [2020-12-23 09:31:19,358 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:19,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2020-12-23 09:31:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 594. [2020-12-23 09:31:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-12-23 09:31:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 764 transitions. [2020-12-23 09:31:19,417 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 764 transitions. Word has length 61 [2020-12-23 09:31:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:19,418 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 764 transitions. [2020-12-23 09:31:19,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:19,418 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 764 transitions. [2020-12-23 09:31:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:19,418 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:19,419 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] [2020-12-23 09:31:19,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:31:19,419 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:19,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:19,419 INFO L82 PathProgramCache]: Analyzing trace with hash 240940801, now seen corresponding path program 1 times [2020-12-23 09:31:19,420 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:19,420 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708100136] [2020-12-23 09:31:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:19,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708100136] [2020-12-23 09:31:19,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:19,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:19,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399544606] [2020-12-23 09:31:19,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:19,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:19,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:19,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:19,458 INFO L87 Difference]: Start difference. First operand 594 states and 764 transitions. Second operand 4 states. [2020-12-23 09:31:19,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:19,634 INFO L93 Difference]: Finished difference Result 1516 states and 1931 transitions. [2020-12-23 09:31:19,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:19,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2020-12-23 09:31:19,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:19,640 INFO L225 Difference]: With dead ends: 1516 [2020-12-23 09:31:19,640 INFO L226 Difference]: Without dead ends: 951 [2020-12-23 09:31:19,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2020-12-23 09:31:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 681. [2020-12-23 09:31:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2020-12-23 09:31:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 848 transitions. [2020-12-23 09:31:19,722 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 848 transitions. Word has length 61 [2020-12-23 09:31:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:19,723 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 848 transitions. [2020-12-23 09:31:19,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 848 transitions. [2020-12-23 09:31:19,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:31:19,724 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:19,724 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] [2020-12-23 09:31:19,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:31:19,724 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:19,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1347407101, now seen corresponding path program 1 times [2020-12-23 09:31:19,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:19,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389198784] [2020-12-23 09:31:19,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:19,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:19,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389198784] [2020-12-23 09:31:19,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:19,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:19,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724585353] [2020-12-23 09:31:19,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:19,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:19,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:19,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:19,761 INFO L87 Difference]: Start difference. First operand 681 states and 848 transitions. Second operand 3 states. [2020-12-23 09:31:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:19,901 INFO L93 Difference]: Finished difference Result 1893 states and 2357 transitions. [2020-12-23 09:31:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:19,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:31:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:19,908 INFO L225 Difference]: With dead ends: 1893 [2020-12-23 09:31:19,908 INFO L226 Difference]: Without dead ends: 1233 [2020-12-23 09:31:19,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-12-23 09:31:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1175. [2020-12-23 09:31:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2020-12-23 09:31:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1451 transitions. [2020-12-23 09:31:20,015 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1451 transitions. Word has length 61 [2020-12-23 09:31:20,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:20,015 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1451 transitions. [2020-12-23 09:31:20,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:20,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1451 transitions. [2020-12-23 09:31:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 09:31:20,017 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:20,017 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:20,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:31:20,018 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:20,018 INFO L82 PathProgramCache]: Analyzing trace with hash -648263858, now seen corresponding path program 1 times [2020-12-23 09:31:20,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:20,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462411286] [2020-12-23 09:31:20,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:20,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462411286] [2020-12-23 09:31:20,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:20,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:20,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61487698] [2020-12-23 09:31:20,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:20,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:20,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:20,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:20,113 INFO L87 Difference]: Start difference. First operand 1175 states and 1451 transitions. Second operand 4 states. [2020-12-23 09:31:20,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:20,466 INFO L93 Difference]: Finished difference Result 3772 states and 4664 transitions. [2020-12-23 09:31:20,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-23 09:31:20,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2020-12-23 09:31:20,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:20,480 INFO L225 Difference]: With dead ends: 3772 [2020-12-23 09:31:20,481 INFO L226 Difference]: Without dead ends: 2634 [2020-12-23 09:31:20,483 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:20,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2020-12-23 09:31:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2065. [2020-12-23 09:31:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2020-12-23 09:31:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2544 transitions. [2020-12-23 09:31:20,745 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2544 transitions. Word has length 99 [2020-12-23 09:31:20,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:20,745 INFO L481 AbstractCegarLoop]: Abstraction has 2065 states and 2544 transitions. [2020-12-23 09:31:20,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:20,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2544 transitions. [2020-12-23 09:31:20,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-12-23 09:31:20,747 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:20,748 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:20,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:31:20,748 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash -838618223, now seen corresponding path program 1 times [2020-12-23 09:31:20,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:20,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212101698] [2020-12-23 09:31:20,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:20,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212101698] [2020-12-23 09:31:20,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:20,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:20,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527252177] [2020-12-23 09:31:20,814 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:20,814 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:20,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:20,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:20,815 INFO L87 Difference]: Start difference. First operand 2065 states and 2544 transitions. Second operand 3 states. [2020-12-23 09:31:21,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:21,191 INFO L93 Difference]: Finished difference Result 5823 states and 7152 transitions. [2020-12-23 09:31:21,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:21,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-12-23 09:31:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:21,209 INFO L225 Difference]: With dead ends: 5823 [2020-12-23 09:31:21,209 INFO L226 Difference]: Without dead ends: 3841 [2020-12-23 09:31:21,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2020-12-23 09:31:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3837. [2020-12-23 09:31:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2020-12-23 09:31:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 4666 transitions. [2020-12-23 09:31:21,586 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 4666 transitions. Word has length 99 [2020-12-23 09:31:21,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:21,586 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 4666 transitions. [2020-12-23 09:31:21,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 4666 transitions. [2020-12-23 09:31:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:31:21,589 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:21,589 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:21,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:31:21,590 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:21,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1280283035, now seen corresponding path program 1 times [2020-12-23 09:31:21,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:21,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414521968] [2020-12-23 09:31:21,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:21,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:21,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414521968] [2020-12-23 09:31:21,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:21,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:21,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123262872] [2020-12-23 09:31:21,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:21,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:21,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:21,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:21,661 INFO L87 Difference]: Start difference. First operand 3837 states and 4666 transitions. Second operand 3 states. [2020-12-23 09:31:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:22,350 INFO L93 Difference]: Finished difference Result 10822 states and 13146 transitions. [2020-12-23 09:31:22,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:22,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 09:31:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:22,387 INFO L225 Difference]: With dead ends: 10822 [2020-12-23 09:31:22,387 INFO L226 Difference]: Without dead ends: 7068 [2020-12-23 09:31:22,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:22,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7068 states. [2020-12-23 09:31:23,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7068 to 7064. [2020-12-23 09:31:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7064 states. [2020-12-23 09:31:23,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7064 states to 7064 states and 8530 transitions. [2020-12-23 09:31:23,082 INFO L78 Accepts]: Start accepts. Automaton has 7064 states and 8530 transitions. Word has length 100 [2020-12-23 09:31:23,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:23,083 INFO L481 AbstractCegarLoop]: Abstraction has 7064 states and 8530 transitions. [2020-12-23 09:31:23,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:23,083 INFO L276 IsEmpty]: Start isEmpty. Operand 7064 states and 8530 transitions. [2020-12-23 09:31:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-12-23 09:31:23,087 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:23,088 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:23,088 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:31:23,088 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:23,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:23,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1663299043, now seen corresponding path program 1 times [2020-12-23 09:31:23,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:23,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737532909] [2020-12-23 09:31:23,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:23,115 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:31:23,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737532909] [2020-12-23 09:31:23,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:23,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:23,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637260264] [2020-12-23 09:31:23,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:23,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:23,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:23,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:23,117 INFO L87 Difference]: Start difference. First operand 7064 states and 8530 transitions. Second operand 3 states. [2020-12-23 09:31:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:23,988 INFO L93 Difference]: Finished difference Result 13968 states and 16884 transitions. [2020-12-23 09:31:23,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:23,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2020-12-23 09:31:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:24,010 INFO L225 Difference]: With dead ends: 13968 [2020-12-23 09:31:24,010 INFO L226 Difference]: Without dead ends: 6987 [2020-12-23 09:31:24,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2020-12-23 09:31:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6987. [2020-12-23 09:31:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6987 states. [2020-12-23 09:31:24,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6987 states to 6987 states and 8445 transitions. [2020-12-23 09:31:24,755 INFO L78 Accepts]: Start accepts. Automaton has 6987 states and 8445 transitions. Word has length 100 [2020-12-23 09:31:24,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:24,755 INFO L481 AbstractCegarLoop]: Abstraction has 6987 states and 8445 transitions. [2020-12-23 09:31:24,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:24,756 INFO L276 IsEmpty]: Start isEmpty. Operand 6987 states and 8445 transitions. [2020-12-23 09:31:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 09:31:24,760 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:24,760 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:24,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:31:24,760 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:24,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:24,761 INFO L82 PathProgramCache]: Analyzing trace with hash 291949850, now seen corresponding path program 1 times [2020-12-23 09:31:24,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:24,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433337177] [2020-12-23 09:31:24,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:24,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433337177] [2020-12-23 09:31:24,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:24,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:24,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331391429] [2020-12-23 09:31:24,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:24,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:24,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:24,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:24,821 INFO L87 Difference]: Start difference. First operand 6987 states and 8445 transitions. Second operand 3 states. [2020-12-23 09:31:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:25,968 INFO L93 Difference]: Finished difference Result 19767 states and 23907 transitions. [2020-12-23 09:31:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:25,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-23 09:31:25,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:25,999 INFO L225 Difference]: With dead ends: 19767 [2020-12-23 09:31:25,999 INFO L226 Difference]: Without dead ends: 12863 [2020-12-23 09:31:26,010 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:26,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12863 states. [2020-12-23 09:31:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12863 to 12859. [2020-12-23 09:31:27,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2020-12-23 09:31:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 15495 transitions. [2020-12-23 09:31:27,248 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 15495 transitions. Word has length 101 [2020-12-23 09:31:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:27,248 INFO L481 AbstractCegarLoop]: Abstraction has 12859 states and 15495 transitions. [2020-12-23 09:31:27,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 15495 transitions. [2020-12-23 09:31:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-12-23 09:31:27,255 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:27,255 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:27,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:31:27,255 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1643335068, now seen corresponding path program 1 times [2020-12-23 09:31:27,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:27,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31280182] [2020-12-23 09:31:27,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:27,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-12-23 09:31:27,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31280182] [2020-12-23 09:31:27,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:27,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:27,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606688544] [2020-12-23 09:31:27,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:27,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:27,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:27,292 INFO L87 Difference]: Start difference. First operand 12859 states and 15495 transitions. Second operand 3 states. [2020-12-23 09:31:28,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:28,344 INFO L93 Difference]: Finished difference Result 25559 states and 30817 transitions. [2020-12-23 09:31:28,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:28,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-12-23 09:31:28,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:28,380 INFO L225 Difference]: With dead ends: 25559 [2020-12-23 09:31:28,381 INFO L226 Difference]: Without dead ends: 12783 [2020-12-23 09:31:28,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12783 states. [2020-12-23 09:31:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12783 to 12783. [2020-12-23 09:31:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12783 states. [2020-12-23 09:31:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12783 states to 12783 states and 15412 transitions. [2020-12-23 09:31:29,492 INFO L78 Accepts]: Start accepts. Automaton has 12783 states and 15412 transitions. Word has length 101 [2020-12-23 09:31:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:29,493 INFO L481 AbstractCegarLoop]: Abstraction has 12783 states and 15412 transitions. [2020-12-23 09:31:29,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 12783 states and 15412 transitions. [2020-12-23 09:31:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-12-23 09:31:29,499 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:29,499 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:29,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:31:29,500 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:29,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1739654126, now seen corresponding path program 1 times [2020-12-23 09:31:29,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:29,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772776474] [2020-12-23 09:31:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:29,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772776474] [2020-12-23 09:31:29,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:29,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:31:29,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507373108] [2020-12-23 09:31:29,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:29,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:29,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:29,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:29,545 INFO L87 Difference]: Start difference. First operand 12783 states and 15412 transitions. Second operand 4 states. [2020-12-23 09:31:31,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:31,295 INFO L93 Difference]: Finished difference Result 36486 states and 43733 transitions. [2020-12-23 09:31:31,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:31:31,296 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-12-23 09:31:31,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:31,334 INFO L225 Difference]: With dead ends: 36486 [2020-12-23 09:31:31,334 INFO L226 Difference]: Without dead ends: 18163 [2020-12-23 09:31:31,359 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18163 states. [2020-12-23 09:31:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18163 to 18159. [2020-12-23 09:31:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18159 states. [2020-12-23 09:31:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18159 states to 18159 states and 21519 transitions. [2020-12-23 09:31:32,609 INFO L78 Accepts]: Start accepts. Automaton has 18159 states and 21519 transitions. Word has length 102 [2020-12-23 09:31:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:32,609 INFO L481 AbstractCegarLoop]: Abstraction has 18159 states and 21519 transitions. [2020-12-23 09:31:32,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 18159 states and 21519 transitions. [2020-12-23 09:31:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2020-12-23 09:31:32,621 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:32,622 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:32,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:31:32,622 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1679759540, now seen corresponding path program 1 times [2020-12-23 09:31:32,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:32,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562772392] [2020-12-23 09:31:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:32,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:32,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562772392] [2020-12-23 09:31:32,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:32,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:32,683 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168079100] [2020-12-23 09:31:32,683 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:32,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:32,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:32,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:32,684 INFO L87 Difference]: Start difference. First operand 18159 states and 21519 transitions. Second operand 3 states. [2020-12-23 09:31:34,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:34,309 INFO L93 Difference]: Finished difference Result 41753 states and 49348 transitions. [2020-12-23 09:31:34,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:34,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2020-12-23 09:31:34,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:34,355 INFO L225 Difference]: With dead ends: 41753 [2020-12-23 09:31:34,355 INFO L226 Difference]: Without dead ends: 23653 [2020-12-23 09:31:34,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23653 states. [2020-12-23 09:31:36,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23653 to 23557. [2020-12-23 09:31:36,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23557 states. [2020-12-23 09:31:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23557 states to 23557 states and 27643 transitions. [2020-12-23 09:31:36,028 INFO L78 Accepts]: Start accepts. Automaton has 23557 states and 27643 transitions. Word has length 131 [2020-12-23 09:31:36,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:36,029 INFO L481 AbstractCegarLoop]: Abstraction has 23557 states and 27643 transitions. [2020-12-23 09:31:36,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 23557 states and 27643 transitions. [2020-12-23 09:31:36,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2020-12-23 09:31:36,048 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:36,049 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2020-12-23 09:31:36,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:31:36,049 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:36,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:36,050 INFO L82 PathProgramCache]: Analyzing trace with hash 736996014, now seen corresponding path program 1 times [2020-12-23 09:31:36,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:36,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804058020] [2020-12-23 09:31:36,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:36,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804058020] [2020-12-23 09:31:36,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:36,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:31:36,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678763343] [2020-12-23 09:31:36,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:36,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:36,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:36,105 INFO L87 Difference]: Start difference. First operand 23557 states and 27643 transitions. Second operand 4 states. [2020-12-23 09:31:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:37,519 INFO L93 Difference]: Finished difference Result 41645 states and 49079 transitions. [2020-12-23 09:31:37,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:31:37,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2020-12-23 09:31:37,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:37,544 INFO L225 Difference]: With dead ends: 41645 [2020-12-23 09:31:37,544 INFO L226 Difference]: Without dead ends: 23569 [2020-12-23 09:31:37,566 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:37,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23569 states. [2020-12-23 09:31:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23569 to 23557. [2020-12-23 09:31:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23557 states. [2020-12-23 09:31:39,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23557 states to 23557 states and 27583 transitions. [2020-12-23 09:31:39,237 INFO L78 Accepts]: Start accepts. Automaton has 23557 states and 27583 transitions. Word has length 148 [2020-12-23 09:31:39,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:39,238 INFO L481 AbstractCegarLoop]: Abstraction has 23557 states and 27583 transitions. [2020-12-23 09:31:39,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:39,238 INFO L276 IsEmpty]: Start isEmpty. Operand 23557 states and 27583 transitions. [2020-12-23 09:31:39,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-12-23 09:31:39,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:39,257 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:39,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:31:39,258 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:39,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:39,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1335072729, now seen corresponding path program 1 times [2020-12-23 09:31:39,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:39,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236770123] [2020-12-23 09:31:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:39,329 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-12-23 09:31:39,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236770123] [2020-12-23 09:31:39,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:39,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:31:39,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920835926] [2020-12-23 09:31:39,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:39,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:39,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:39,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:39,331 INFO L87 Difference]: Start difference. First operand 23557 states and 27583 transitions. Second operand 3 states. [2020-12-23 09:31:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:41,215 INFO L93 Difference]: Finished difference Result 52059 states and 60812 transitions. [2020-12-23 09:31:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:41,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2020-12-23 09:31:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:41,244 INFO L225 Difference]: With dead ends: 52059 [2020-12-23 09:31:41,245 INFO L226 Difference]: Without dead ends: 28547 [2020-12-23 09:31:41,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28547 states. [2020-12-23 09:31:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28547 to 28419. [2020-12-23 09:31:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28419 states. [2020-12-23 09:31:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28419 states to 28419 states and 33011 transitions. [2020-12-23 09:31:43,056 INFO L78 Accepts]: Start accepts. Automaton has 28419 states and 33011 transitions. Word has length 177 [2020-12-23 09:31:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:43,056 INFO L481 AbstractCegarLoop]: Abstraction has 28419 states and 33011 transitions. [2020-12-23 09:31:43,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 28419 states and 33011 transitions. [2020-12-23 09:31:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-23 09:31:43,082 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:43,083 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:43,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:31:43,083 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:43,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:43,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1751786614, now seen corresponding path program 1 times [2020-12-23 09:31:43,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:43,084 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672158148] [2020-12-23 09:31:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:43,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672158148] [2020-12-23 09:31:43,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:43,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:31:43,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521769682] [2020-12-23 09:31:43,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:43,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:43,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:43,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:43,147 INFO L87 Difference]: Start difference. First operand 28419 states and 33011 transitions. Second operand 4 states. [2020-12-23 09:31:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:45,247 INFO L93 Difference]: Finished difference Result 51907 states and 60515 transitions. [2020-12-23 09:31:45,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:31:45,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2020-12-23 09:31:45,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:45,280 INFO L225 Difference]: With dead ends: 51907 [2020-12-23 09:31:45,281 INFO L226 Difference]: Without dead ends: 28431 [2020-12-23 09:31:45,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28431 states. [2020-12-23 09:31:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28431 to 28419. [2020-12-23 09:31:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28419 states. [2020-12-23 09:31:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28419 states to 28419 states and 32911 transitions. [2020-12-23 09:31:47,218 INFO L78 Accepts]: Start accepts. Automaton has 28419 states and 32911 transitions. Word has length 180 [2020-12-23 09:31:47,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:47,218 INFO L481 AbstractCegarLoop]: Abstraction has 28419 states and 32911 transitions. [2020-12-23 09:31:47,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:47,218 INFO L276 IsEmpty]: Start isEmpty. Operand 28419 states and 32911 transitions. [2020-12-23 09:31:47,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-12-23 09:31:47,240 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:47,240 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:47,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:31:47,241 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1117959826, now seen corresponding path program 1 times [2020-12-23 09:31:47,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:47,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333521779] [2020-12-23 09:31:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 09:31:47,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333521779] [2020-12-23 09:31:47,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:47,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:31:47,322 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905525250] [2020-12-23 09:31:47,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:31:47,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:47,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:31:47,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:31:47,324 INFO L87 Difference]: Start difference. First operand 28419 states and 32911 transitions. Second operand 4 states. [2020-12-23 09:31:49,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:49,234 INFO L93 Difference]: Finished difference Result 56771 states and 65747 transitions. [2020-12-23 09:31:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:31:49,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2020-12-23 09:31:49,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:49,262 INFO L225 Difference]: With dead ends: 56771 [2020-12-23 09:31:49,262 INFO L226 Difference]: Without dead ends: 25869 [2020-12-23 09:31:49,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:31:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25869 states. [2020-12-23 09:31:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25869 to 25849. [2020-12-23 09:31:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2020-12-23 09:31:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 29820 transitions. [2020-12-23 09:31:50,942 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 29820 transitions. Word has length 212 [2020-12-23 09:31:50,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:50,943 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 29820 transitions. [2020-12-23 09:31:50,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:31:50,943 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 29820 transitions. [2020-12-23 09:31:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2020-12-23 09:31:50,952 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:50,952 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:50,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-12-23 09:31:50,952 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:50,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1763021255, now seen corresponding path program 1 times [2020-12-23 09:31:50,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:50,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278126586] [2020-12-23 09:31:50,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:51,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278126586] [2020-12-23 09:31:51,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:51,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:51,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738545103] [2020-12-23 09:31:51,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:51,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:51,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:51,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:51,019 INFO L87 Difference]: Start difference. First operand 25849 states and 29820 transitions. Second operand 3 states. [2020-12-23 09:31:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:52,835 INFO L93 Difference]: Finished difference Result 47941 states and 55471 transitions. [2020-12-23 09:31:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:52,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2020-12-23 09:31:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:52,860 INFO L225 Difference]: With dead ends: 47941 [2020-12-23 09:31:52,860 INFO L226 Difference]: Without dead ends: 25897 [2020-12-23 09:31:52,876 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25897 states. [2020-12-23 09:31:54,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25897 to 25849. [2020-12-23 09:31:54,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2020-12-23 09:31:54,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 29228 transitions. [2020-12-23 09:31:54,442 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 29228 transitions. Word has length 212 [2020-12-23 09:31:54,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:54,442 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 29228 transitions. [2020-12-23 09:31:54,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 29228 transitions. [2020-12-23 09:31:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-23 09:31:54,451 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:54,451 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:54,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-12-23 09:31:54,451 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:54,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:54,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1865011049, now seen corresponding path program 1 times [2020-12-23 09:31:54,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:54,452 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542601433] [2020-12-23 09:31:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:31:54,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542601433] [2020-12-23 09:31:54,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:54,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:54,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481540277] [2020-12-23 09:31:54,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:54,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:54,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:54,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:54,539 INFO L87 Difference]: Start difference. First operand 25849 states and 29228 transitions. Second operand 3 states. [2020-12-23 09:31:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:56,154 INFO L93 Difference]: Finished difference Result 45103 states and 51221 transitions. [2020-12-23 09:31:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:56,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2020-12-23 09:31:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:56,179 INFO L225 Difference]: With dead ends: 45103 [2020-12-23 09:31:56,179 INFO L226 Difference]: Without dead ends: 25905 [2020-12-23 09:31:56,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25905 states. [2020-12-23 09:31:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25905 to 25849. [2020-12-23 09:31:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2020-12-23 09:31:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 28728 transitions. [2020-12-23 09:31:57,807 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 28728 transitions. Word has length 215 [2020-12-23 09:31:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:31:57,807 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 28728 transitions. [2020-12-23 09:31:57,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:31:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 28728 transitions. [2020-12-23 09:31:57,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-12-23 09:31:57,815 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:31:57,815 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:31:57,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-12-23 09:31:57,815 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:31:57,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:31:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash 562185031, now seen corresponding path program 1 times [2020-12-23 09:31:57,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:31:57,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218201202] [2020-12-23 09:31:57,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:31:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:31:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:31:58,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218201202] [2020-12-23 09:31:58,046 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:31:58,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:31:58,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397438577] [2020-12-23 09:31:58,046 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:31:58,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:31:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:31:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:58,047 INFO L87 Difference]: Start difference. First operand 25849 states and 28728 transitions. Second operand 3 states. [2020-12-23 09:31:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:31:59,865 INFO L93 Difference]: Finished difference Result 42795 states and 47751 transitions. [2020-12-23 09:31:59,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:31:59,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2020-12-23 09:31:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:31:59,887 INFO L225 Difference]: With dead ends: 42795 [2020-12-23 09:31:59,888 INFO L226 Difference]: Without dead ends: 26663 [2020-12-23 09:31:59,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:31:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26663 states. [2020-12-23 09:32:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26663 to 25849. [2020-12-23 09:32:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2020-12-23 09:32:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 28326 transitions. [2020-12-23 09:32:01,510 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 28326 transitions. Word has length 218 [2020-12-23 09:32:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:32:01,510 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 28326 transitions. [2020-12-23 09:32:01,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:32:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 28326 transitions. [2020-12-23 09:32:01,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-12-23 09:32:01,518 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:32:01,518 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:32:01,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-12-23 09:32:01,519 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:32:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:32:01,519 INFO L82 PathProgramCache]: Analyzing trace with hash -928723252, now seen corresponding path program 1 times [2020-12-23 09:32:01,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:32:01,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762038603] [2020-12-23 09:32:01,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:32:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:32:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:32:01,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762038603] [2020-12-23 09:32:01,591 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:32:01,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:32:01,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514360573] [2020-12-23 09:32:01,592 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:32:01,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:32:01,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:32:01,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:32:01,593 INFO L87 Difference]: Start difference. First operand 25849 states and 28326 transitions. Second operand 3 states. [2020-12-23 09:32:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:32:02,761 INFO L93 Difference]: Finished difference Result 43179 states and 47446 transitions. [2020-12-23 09:32:02,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:32:02,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2020-12-23 09:32:02,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:32:02,780 INFO L225 Difference]: With dead ends: 43179 [2020-12-23 09:32:02,780 INFO L226 Difference]: Without dead ends: 17409 [2020-12-23 09:32:02,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:32:02,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17409 states. [2020-12-23 09:32:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17409 to 17377. [2020-12-23 09:32:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2020-12-23 09:32:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 18817 transitions. [2020-12-23 09:32:03,986 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 18817 transitions. Word has length 220 [2020-12-23 09:32:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:32:03,987 INFO L481 AbstractCegarLoop]: Abstraction has 17377 states and 18817 transitions. [2020-12-23 09:32:03,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:32:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 18817 transitions. [2020-12-23 09:32:03,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2020-12-23 09:32:03,997 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:32:03,998 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:32:03,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-12-23 09:32:03,998 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:32:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:32:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1613896568, now seen corresponding path program 1 times [2020-12-23 09:32:03,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:32:03,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904646634] [2020-12-23 09:32:03,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:32:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:32:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:32:04,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904646634] [2020-12-23 09:32:04,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:32:04,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-23 09:32:04,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274080221] [2020-12-23 09:32:04,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-23 09:32:04,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:32:04,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-23 09:32:04,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:32:04,283 INFO L87 Difference]: Start difference. First operand 17377 states and 18817 transitions. Second operand 6 states. [2020-12-23 09:32:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:32:08,157 INFO L93 Difference]: Finished difference Result 66251 states and 71727 transitions. [2020-12-23 09:32:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:32:08,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2020-12-23 09:32:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:32:08,217 INFO L225 Difference]: With dead ends: 66251 [2020-12-23 09:32:08,218 INFO L226 Difference]: Without dead ends: 59635 [2020-12-23 09:32:08,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-23 09:32:08,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59635 states. [2020-12-23 09:32:10,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59635 to 32304. [2020-12-23 09:32:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32304 states. [2020-12-23 09:32:10,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32304 states to 32304 states and 35058 transitions. [2020-12-23 09:32:10,896 INFO L78 Accepts]: Start accepts. Automaton has 32304 states and 35058 transitions. Word has length 223 [2020-12-23 09:32:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:32:10,897 INFO L481 AbstractCegarLoop]: Abstraction has 32304 states and 35058 transitions. [2020-12-23 09:32:10,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-23 09:32:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 32304 states and 35058 transitions. [2020-12-23 09:32:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2020-12-23 09:32:10,908 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:32:10,908 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:32:10,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-12-23 09:32:10,908 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:32:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:32:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1852984938, now seen corresponding path program 1 times [2020-12-23 09:32:10,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:32:10,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483217402] [2020-12-23 09:32:10,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:32:10,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:32:10,992 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-12-23 09:32:10,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483217402] [2020-12-23 09:32:10,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:32:10,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:32:10,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461543742] [2020-12-23 09:32:10,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:32:10,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:32:10,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:32:10,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:32:10,995 INFO L87 Difference]: Start difference. First operand 32304 states and 35058 transitions. Second operand 3 states. [2020-12-23 09:32:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:32:14,529 INFO L93 Difference]: Finished difference Result 69579 states and 75699 transitions. [2020-12-23 09:32:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:32:14,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2020-12-23 09:32:14,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:32:14,585 INFO L225 Difference]: With dead ends: 69579 [2020-12-23 09:32:14,585 INFO L226 Difference]: Without dead ends: 50858 [2020-12-23 09:32:14,601 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:32:14,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50858 states. [2020-12-23 09:32:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50858 to 32320. [2020-12-23 09:32:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32320 states. [2020-12-23 09:32:17,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32320 states to 32320 states and 35074 transitions. [2020-12-23 09:32:17,122 INFO L78 Accepts]: Start accepts. Automaton has 32320 states and 35074 transitions. Word has length 227 [2020-12-23 09:32:17,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:32:17,123 INFO L481 AbstractCegarLoop]: Abstraction has 32320 states and 35074 transitions. [2020-12-23 09:32:17,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:32:17,123 INFO L276 IsEmpty]: Start isEmpty. Operand 32320 states and 35074 transitions. [2020-12-23 09:32:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-12-23 09:32:17,132 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:32:17,132 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:32:17,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-12-23 09:32:17,132 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:32:17,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:32:17,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1845395018, now seen corresponding path program 1 times [2020-12-23 09:32:17,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:32:17,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000594677] [2020-12-23 09:32:17,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:32:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:32:17,162 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:32:17,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:32:17,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:32:17,564 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 09:32:17,564 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 09:32:17,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-12-23 09:32:17,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:32:17 BoogieIcfgContainer [2020-12-23 09:32:17,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:32:17,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:32:17,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:32:17,856 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:32:17,856 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:31:15" (3/4) ... [2020-12-23 09:32:17,858 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 09:32:18,094 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/token_ring.03.cil-1.c-witness.graphml [2020-12-23 09:32:18,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:32:18,097 INFO L168 Benchmark]: Toolchain (without parser) took 64476.85 ms. Allocated memory was 154.1 MB in the beginning and 5.5 GB in the end (delta: 5.4 GB). Free memory was 129.3 MB in the beginning and 4.6 GB in the end (delta: -4.4 GB). Peak memory consumption was 919.2 MB. Max. memory is 8.0 GB. [2020-12-23 09:32:18,097 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 154.1 MB. Free memory is still 127.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:32:18,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.08 ms. Allocated memory is still 154.1 MB. Free memory was 129.1 MB in the beginning and 114.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:32:18,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.83 ms. Allocated memory is still 154.1 MB. Free memory was 113.9 MB in the beginning and 110.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:32:18,098 INFO L168 Benchmark]: Boogie Preprocessor took 55.46 ms. Allocated memory is still 154.1 MB. Free memory was 110.2 MB in the beginning and 107.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:32:18,099 INFO L168 Benchmark]: RCFGBuilder took 1152.57 ms. Allocated memory is still 154.1 MB. Free memory was 106.8 MB in the beginning and 64.3 MB in the end (delta: 42.6 MB). Peak memory consumption was 42.2 MB. Max. memory is 8.0 GB. [2020-12-23 09:32:18,099 INFO L168 Benchmark]: TraceAbstraction took 62333.55 ms. Allocated memory was 154.1 MB in the beginning and 5.5 GB in the end (delta: 5.4 GB). Free memory was 63.8 MB in the beginning and 4.6 GB in the end (delta: -4.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 8.0 GB. [2020-12-23 09:32:18,099 INFO L168 Benchmark]: Witness Printer took 239.51 ms. Allocated memory is still 5.5 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 39.5 MB). Peak memory consumption was 39.8 MB. Max. memory is 8.0 GB. [2020-12-23 09:32:18,102 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 154.1 MB. Free memory is still 127.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 562.08 ms. Allocated memory is still 154.1 MB. Free memory was 129.1 MB in the beginning and 114.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 118.83 ms. Allocated memory is still 154.1 MB. Free memory was 113.9 MB in the beginning and 110.2 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 55.46 ms. Allocated memory is still 154.1 MB. Free memory was 110.2 MB in the beginning and 107.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1152.57 ms. Allocated memory is still 154.1 MB. Free memory was 106.8 MB in the beginning and 64.3 MB in the end (delta: 42.6 MB). Peak memory consumption was 42.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 62333.55 ms. Allocated memory was 154.1 MB in the beginning and 5.5 GB in the end (delta: 5.4 GB). Free memory was 63.8 MB in the beginning and 4.6 GB in the end (delta: -4.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 8.0 GB. * Witness Printer took 239.51 ms. Allocated memory is still 5.5 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 39.5 MB). Peak memory consumption was 39.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int t3_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int t3_st ; [L24] int m_i ; [L25] int t1_i ; [L26] int t2_i ; [L27] int t3_i ; [L28] int M_E = 2; [L29] int T1_E = 2; [L30] int T2_E = 2; [L31] int T3_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; [L41] int token ; [L43] int local ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L727] int __retres1 ; [L640] m_i = 1 [L641] t1_i = 1 [L642] t2_i = 1 [L643] t3_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L668] int kernel_st ; [L669] int tmp ; [L670] int tmp___0 ; [L674] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L296] COND TRUE m_i == 1 [L297] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L301] COND TRUE t1_i == 1 [L302] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L306] COND TRUE t2_i == 1 [L307] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L311] COND TRUE t3_i == 1 [L312] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L433] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L438] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L443] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L448] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L453] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L458] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L463] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L468] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L224] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L231] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L243] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L250] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L262] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L269] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L281] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L481] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L486] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L491] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L496] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L501] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L506] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L511] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L516] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L682] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L685] kernel_st = 1 [L352] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L356] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L321] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L347] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L104] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L115] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L140] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L151] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L176] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L187] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L356] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L321] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L347] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L59] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L62] token = __VERIFIER_nondet_int() [L63] local = token [L64] E_1 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L222] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L224] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L228] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L231] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L232] COND TRUE E_1 == 1 [L233] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L243] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L541] tmp___0 = is_transmit1_triggered() [L543] COND TRUE \read(tmp___0) [L544] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L247] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L250] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L251] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L260] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L262] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L266] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L269] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L270] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L279] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L281] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L66] E_1 = 2 [L67] m_pc = 1 [L68] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L104] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L107] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L123] token += 1 [L124] E_2 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L222] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L224] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L228] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L241] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L243] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L247] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L251] COND TRUE E_2 == 1 [L252] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L262] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L549] tmp___1 = is_transmit2_triggered() [L551] COND TRUE \read(tmp___1) [L552] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L266] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L279] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L281] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L126] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L115] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L140] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L143] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L159] token += 1 [L160] E_3 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L224] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L243] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L262] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L270] COND TRUE E_3 == 1 [L271] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L281] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L557] tmp___2 = is_transmit3_triggered() [L559] COND TRUE \read(tmp___2) [L560] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L162] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L151] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L176] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L179] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L195] token += 1 [L196] E_M = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L213] COND TRUE E_M == 1 [L214] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L224] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L533] tmp = is_master_triggered() [L535] COND TRUE \read(tmp) [L536] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L243] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L262] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L281] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L198] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L187] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L356] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L321] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L347] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L51] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L73] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L78] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L84] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L85] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L86] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L12] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 316 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 61.9s, OverallIterations: 35, TraceHistogramMax: 3, AutomataDifference: 32.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17417 SDtfs, 20944 SDslu, 17522 SDs, 0 SdLazy, 949 SolverSat, 346 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32320occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 50994 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 4069 NumberOfCodeBlocks, 4069 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3807 ConstructedInterpolants, 0 QuantifiedInterpolants, 1090171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 449/449 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...