/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/transmitter.03.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:36:22,456 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:36:22,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:36:22,521 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:36:22,522 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:36:22,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:36:22,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:36:22,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:36:22,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:36:22,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:36:22,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:36:22,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:36:22,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:36:22,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:36:22,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:36:22,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:36:22,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:36:22,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:36:22,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:36:22,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:36:22,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:36:22,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:36:22,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:36:22,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:36:22,588 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:36:22,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:36:22,589 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:36:22,590 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:36:22,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:36:22,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:36:22,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:36:22,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:36:22,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:36:22,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:36:22,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:36:22,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:36:22,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:36:22,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:36:22,598 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:36:22,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:36:22,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:36:22,602 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:36:22,650 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:36:22,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:36:22,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:36:22,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:36:22,653 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:36:22,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:36:22,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:36:22,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:36:22,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:36:22,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:36:22,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:36:22,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:36:22,655 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:36:22,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:36:22,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:36:22,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:36:22,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:36:22,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:36:22,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:36:22,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:36:22,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:36:22,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:36:22,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:36:22,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:36:22,658 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:36:22,658 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:36:23,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:36:23,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:36:23,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:36:23,073 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:36:23,074 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:36:23,075 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-12-23 09:36:23,157 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ea0c4e1d1/2008ff28d85f466e9899125837af6df7/FLAGa4f374ca6 [2020-12-23 09:36:23,882 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:36:23,883 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c [2020-12-23 09:36:23,896 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ea0c4e1d1/2008ff28d85f466e9899125837af6df7/FLAGa4f374ca6 [2020-12-23 09:36:24,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/ea0c4e1d1/2008ff28d85f466e9899125837af6df7 [2020-12-23 09:36:24,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:36:24,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:36:24,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:36:24,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:36:24,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:36:24,243 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:36:24" (1/1) ... [2020-12-23 09:36:24,246 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e99e9c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24, skipping insertion in model container [2020-12-23 09:36:24,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:36:24" (1/1) ... [2020-12-23 09:36:24,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:36:24,317 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:36:24,504 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__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_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_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_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:36:24,583 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:36:24,594 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:36:24,606 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.03.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__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_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_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_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:36:24,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:36:24,680 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:36:24,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24 WrapperNode [2020-12-23 09:36:24,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:36:24,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:36:24,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:36:24,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:36:24,691 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:36:24" (1/1) ... [2020-12-23 09:36:24,703 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:36:24" (1/1) ... [2020-12-23 09:36:24,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:36:24,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:36:24,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:36:24,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:36:24,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24" (1/1) ... [2020-12-23 09:36:24,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24" (1/1) ... [2020-12-23 09:36:24,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24" (1/1) ... [2020-12-23 09:36:24,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24" (1/1) ... [2020-12-23 09:36:24,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24" (1/1) ... [2020-12-23 09:36:24,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24" (1/1) ... [2020-12-23 09:36:24,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24" (1/1) ... [2020-12-23 09:36:24,831 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:36:24,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:36:24,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:36:24,836 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:36:24,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24" (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:36:24,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:36:24,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:36:24,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:36:24,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:36:25,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:36:25,925 INFO L299 CfgBuilder]: Removed 119 assume(true) statements. [2020-12-23 09:36:25,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:36:25 BoogieIcfgContainer [2020-12-23 09:36:25,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:36:25,931 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:36:25,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:36:25,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:36:25,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:36:24" (1/3) ... [2020-12-23 09:36:25,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d476e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:36:25, skipping insertion in model container [2020-12-23 09:36:25,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:36:24" (2/3) ... [2020-12-23 09:36:25,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d476e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:36:25, skipping insertion in model container [2020-12-23 09:36:25,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:36:25" (3/3) ... [2020-12-23 09:36:25,939 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.03.cil.c [2020-12-23 09:36:25,947 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:36:25,955 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:36:25,980 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:36:26,017 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:36:26,017 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:36:26,017 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:36:26,018 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:36:26,018 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:36:26,018 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:36:26,018 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:36:26,018 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:36:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states. [2020-12-23 09:36:26,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:26,057 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:26,058 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:36:26,059 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:26,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1838342379, now seen corresponding path program 1 times [2020-12-23 09:36:26,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:26,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124345134] [2020-12-23 09:36:26,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:26,309 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:36:26,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124345134] [2020-12-23 09:36:26,311 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:26,311 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:26,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680831721] [2020-12-23 09:36:26,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:26,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:26,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:26,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:26,335 INFO L87 Difference]: Start difference. First operand 276 states. Second operand 3 states. [2020-12-23 09:36:26,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:26,444 INFO L93 Difference]: Finished difference Result 547 states and 857 transitions. [2020-12-23 09:36:26,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:26,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:36:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:26,477 INFO L225 Difference]: With dead ends: 547 [2020-12-23 09:36:26,478 INFO L226 Difference]: Without dead ends: 272 [2020-12-23 09:36:26,483 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:36:26,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-12-23 09:36:26,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2020-12-23 09:36:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-12-23 09:36:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 412 transitions. [2020-12-23 09:36:26,579 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 412 transitions. Word has length 61 [2020-12-23 09:36:26,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:26,579 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 412 transitions. [2020-12-23 09:36:26,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:26,580 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 412 transitions. [2020-12-23 09:36:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:26,582 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:26,583 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:36:26,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:36:26,583 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:26,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1195707667, now seen corresponding path program 1 times [2020-12-23 09:36:26,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:26,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160655244] [2020-12-23 09:36:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:26,654 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:36:26,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160655244] [2020-12-23 09:36:26,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:26,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:36:26,656 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745125857] [2020-12-23 09:36:26,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:26,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:26,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:26,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:26,660 INFO L87 Difference]: Start difference. First operand 272 states and 412 transitions. Second operand 3 states. [2020-12-23 09:36:26,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:26,778 INFO L93 Difference]: Finished difference Result 730 states and 1104 transitions. [2020-12-23 09:36:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:26,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:36:26,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:26,783 INFO L225 Difference]: With dead ends: 730 [2020-12-23 09:36:26,783 INFO L226 Difference]: Without dead ends: 466 [2020-12-23 09:36:26,785 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:36:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2020-12-23 09:36:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2020-12-23 09:36:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-12-23 09:36:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 694 transitions. [2020-12-23 09:36:26,831 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 694 transitions. Word has length 61 [2020-12-23 09:36:26,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:26,831 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 694 transitions. [2020-12-23 09:36:26,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 694 transitions. [2020-12-23 09:36:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:26,834 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:26,834 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:36:26,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:36:26,835 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:26,835 INFO L82 PathProgramCache]: Analyzing trace with hash 266288339, now seen corresponding path program 1 times [2020-12-23 09:36:26,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:26,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247934429] [2020-12-23 09:36:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:26,896 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:36:26,896 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247934429] [2020-12-23 09:36:26,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:26,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:36:26,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070669285] [2020-12-23 09:36:26,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:26,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:26,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:26,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:26,899 INFO L87 Difference]: Start difference. First operand 464 states and 694 transitions. Second operand 3 states. [2020-12-23 09:36:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:26,939 INFO L93 Difference]: Finished difference Result 919 states and 1375 transitions. [2020-12-23 09:36:26,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:26,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:36:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:26,947 INFO L225 Difference]: With dead ends: 919 [2020-12-23 09:36:26,948 INFO L226 Difference]: Without dead ends: 464 [2020-12-23 09:36:26,950 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:36:26,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-12-23 09:36:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-12-23 09:36:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-12-23 09:36:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 686 transitions. [2020-12-23 09:36:26,984 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 686 transitions. Word has length 61 [2020-12-23 09:36:26,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:26,984 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 686 transitions. [2020-12-23 09:36:26,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 686 transitions. [2020-12-23 09:36:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:26,987 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:26,987 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:36:26,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-23 09:36:26,988 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:26,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:26,989 INFO L82 PathProgramCache]: Analyzing trace with hash 710189013, now seen corresponding path program 1 times [2020-12-23 09:36:26,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:26,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198341779] [2020-12-23 09:36:26,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:27,087 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:36:27,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198341779] [2020-12-23 09:36:27,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:27,088 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:36:27,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010673881] [2020-12-23 09:36:27,089 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:27,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:27,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:27,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:27,092 INFO L87 Difference]: Start difference. First operand 464 states and 686 transitions. Second operand 3 states. [2020-12-23 09:36:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:27,133 INFO L93 Difference]: Finished difference Result 918 states and 1358 transitions. [2020-12-23 09:36:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:27,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:36:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:27,140 INFO L225 Difference]: With dead ends: 918 [2020-12-23 09:36:27,140 INFO L226 Difference]: Without dead ends: 464 [2020-12-23 09:36:27,141 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:36:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-12-23 09:36:27,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-12-23 09:36:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-12-23 09:36:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 678 transitions. [2020-12-23 09:36:27,178 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 678 transitions. Word has length 61 [2020-12-23 09:36:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:27,180 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 678 transitions. [2020-12-23 09:36:27,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:27,180 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 678 transitions. [2020-12-23 09:36:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:27,182 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:27,182 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:36:27,182 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-23 09:36:27,183 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:27,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:27,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1623736427, now seen corresponding path program 1 times [2020-12-23 09:36:27,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:27,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528971115] [2020-12-23 09:36:27,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:27,252 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:36:27,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528971115] [2020-12-23 09:36:27,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:27,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:36:27,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812725477] [2020-12-23 09:36:27,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:27,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:27,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:27,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:27,255 INFO L87 Difference]: Start difference. First operand 464 states and 678 transitions. Second operand 3 states. [2020-12-23 09:36:27,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:27,294 INFO L93 Difference]: Finished difference Result 917 states and 1341 transitions. [2020-12-23 09:36:27,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:27,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:36:27,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:27,298 INFO L225 Difference]: With dead ends: 917 [2020-12-23 09:36:27,298 INFO L226 Difference]: Without dead ends: 464 [2020-12-23 09:36:27,300 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:36:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-12-23 09:36:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-12-23 09:36:27,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-12-23 09:36:27,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 670 transitions. [2020-12-23 09:36:27,326 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 670 transitions. Word has length 61 [2020-12-23 09:36:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:27,327 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 670 transitions. [2020-12-23 09:36:27,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 670 transitions. [2020-12-23 09:36:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:27,328 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:27,329 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:36:27,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-23 09:36:27,329 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:27,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash -175003691, now seen corresponding path program 1 times [2020-12-23 09:36:27,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:27,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360290277] [2020-12-23 09:36:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:27,381 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:36:27,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360290277] [2020-12-23 09:36:27,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:27,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:36:27,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457906409] [2020-12-23 09:36:27,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:27,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:27,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:27,385 INFO L87 Difference]: Start difference. First operand 464 states and 670 transitions. Second operand 3 states. [2020-12-23 09:36:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:27,440 INFO L93 Difference]: Finished difference Result 916 states and 1324 transitions. [2020-12-23 09:36:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:27,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:36:27,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:27,444 INFO L225 Difference]: With dead ends: 916 [2020-12-23 09:36:27,444 INFO L226 Difference]: Without dead ends: 464 [2020-12-23 09:36:27,445 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:36:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-12-23 09:36:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-12-23 09:36:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-12-23 09:36:27,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 654 transitions. [2020-12-23 09:36:27,469 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 654 transitions. Word has length 61 [2020-12-23 09:36:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:27,469 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 654 transitions. [2020-12-23 09:36:27,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 654 transitions. [2020-12-23 09:36:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:27,470 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:27,471 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:36:27,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-23 09:36:27,471 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1945036492, now seen corresponding path program 1 times [2020-12-23 09:36:27,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:27,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945382313] [2020-12-23 09:36:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:27,511 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:36:27,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945382313] [2020-12-23 09:36:27,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:27,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:36:27,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090668971] [2020-12-23 09:36:27,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:27,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:27,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:27,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:27,514 INFO L87 Difference]: Start difference. First operand 464 states and 654 transitions. Second operand 3 states. [2020-12-23 09:36:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:27,567 INFO L93 Difference]: Finished difference Result 914 states and 1289 transitions. [2020-12-23 09:36:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:27,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:36:27,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:27,571 INFO L225 Difference]: With dead ends: 914 [2020-12-23 09:36:27,571 INFO L226 Difference]: Without dead ends: 464 [2020-12-23 09:36:27,573 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:36:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-12-23 09:36:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2020-12-23 09:36:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2020-12-23 09:36:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 638 transitions. [2020-12-23 09:36:27,599 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 638 transitions. Word has length 61 [2020-12-23 09:36:27,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:27,599 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 638 transitions. [2020-12-23 09:36:27,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 638 transitions. [2020-12-23 09:36:27,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:27,600 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:27,600 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:36:27,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-23 09:36:27,601 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:27,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1902661357, now seen corresponding path program 1 times [2020-12-23 09:36:27,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:27,602 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5692058] [2020-12-23 09:36:27,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:27,647 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:36:27,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5692058] [2020-12-23 09:36:27,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:27,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:36:27,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312363329] [2020-12-23 09:36:27,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:36:27,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:27,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:36:27,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:36:27,650 INFO L87 Difference]: Start difference. First operand 464 states and 638 transitions. Second operand 5 states. [2020-12-23 09:36:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:27,821 INFO L93 Difference]: Finished difference Result 1468 states and 2029 transitions. [2020-12-23 09:36:27,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:36:27,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 09:36:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:27,828 INFO L225 Difference]: With dead ends: 1468 [2020-12-23 09:36:27,828 INFO L226 Difference]: Without dead ends: 1025 [2020-12-23 09:36:27,830 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:36:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2020-12-23 09:36:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 479. [2020-12-23 09:36:27,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2020-12-23 09:36:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 648 transitions. [2020-12-23 09:36:27,866 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 648 transitions. Word has length 61 [2020-12-23 09:36:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:27,866 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 648 transitions. [2020-12-23 09:36:27,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:36:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 648 transitions. [2020-12-23 09:36:27,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:27,867 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:27,868 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:36:27,868 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-23 09:36:27,868 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:27,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:27,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1654514863, now seen corresponding path program 1 times [2020-12-23 09:36:27,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:27,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982581128] [2020-12-23 09:36:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:27,909 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:36:27,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982581128] [2020-12-23 09:36:27,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:27,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:36:27,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742663692] [2020-12-23 09:36:27,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:36:27,911 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:27,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:36:27,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:36:27,912 INFO L87 Difference]: Start difference. First operand 479 states and 648 transitions. Second operand 5 states. [2020-12-23 09:36:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:28,050 INFO L93 Difference]: Finished difference Result 1256 states and 1713 transitions. [2020-12-23 09:36:28,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:36:28,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 09:36:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:28,055 INFO L225 Difference]: With dead ends: 1256 [2020-12-23 09:36:28,056 INFO L226 Difference]: Without dead ends: 805 [2020-12-23 09:36:28,057 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:36:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2020-12-23 09:36:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 485. [2020-12-23 09:36:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-12-23 09:36:28,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 646 transitions. [2020-12-23 09:36:28,100 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 646 transitions. Word has length 61 [2020-12-23 09:36:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:28,100 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 646 transitions. [2020-12-23 09:36:28,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:36:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 646 transitions. [2020-12-23 09:36:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:28,101 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:28,101 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:36:28,102 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-23 09:36:28,102 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:28,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:28,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2048881649, now seen corresponding path program 1 times [2020-12-23 09:36:28,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:28,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142342667] [2020-12-23 09:36:28,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:28,147 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:36:28,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142342667] [2020-12-23 09:36:28,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:28,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:36:28,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089690219] [2020-12-23 09:36:28,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:36:28,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:36:28,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:36:28,150 INFO L87 Difference]: Start difference. First operand 485 states and 646 transitions. Second operand 5 states. [2020-12-23 09:36:28,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:28,362 INFO L93 Difference]: Finished difference Result 1610 states and 2151 transitions. [2020-12-23 09:36:28,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:36:28,362 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 09:36:28,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:28,369 INFO L225 Difference]: With dead ends: 1610 [2020-12-23 09:36:28,369 INFO L226 Difference]: Without dead ends: 1160 [2020-12-23 09:36:28,370 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:36:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-12-23 09:36:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 515. [2020-12-23 09:36:28,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-12-23 09:36:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 676 transitions. [2020-12-23 09:36:28,421 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 676 transitions. Word has length 61 [2020-12-23 09:36:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:28,421 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 676 transitions. [2020-12-23 09:36:28,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:36:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 676 transitions. [2020-12-23 09:36:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:28,422 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:28,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:36:28,423 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-23 09:36:28,423 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:28,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2026249395, now seen corresponding path program 1 times [2020-12-23 09:36:28,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:28,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035910914] [2020-12-23 09:36:28,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:28,463 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:36:28,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035910914] [2020-12-23 09:36:28,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:28,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:36:28,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020522095] [2020-12-23 09:36:28,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:36:28,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:28,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:36:28,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:36:28,466 INFO L87 Difference]: Start difference. First operand 515 states and 676 transitions. Second operand 5 states. [2020-12-23 09:36:28,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:28,629 INFO L93 Difference]: Finished difference Result 1397 states and 1850 transitions. [2020-12-23 09:36:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-23 09:36:28,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2020-12-23 09:36:28,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:28,635 INFO L225 Difference]: With dead ends: 1397 [2020-12-23 09:36:28,635 INFO L226 Difference]: Without dead ends: 927 [2020-12-23 09:36:28,637 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:36:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2020-12-23 09:36:28,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 521. [2020-12-23 09:36:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-12-23 09:36:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 674 transitions. [2020-12-23 09:36:28,705 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 674 transitions. Word has length 61 [2020-12-23 09:36:28,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:28,706 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 674 transitions. [2020-12-23 09:36:28,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:36:28,706 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 674 transitions. [2020-12-23 09:36:28,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:28,707 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:28,707 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:36:28,707 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-23 09:36:28,707 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:28,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:28,708 INFO L82 PathProgramCache]: Analyzing trace with hash 2134704395, now seen corresponding path program 1 times [2020-12-23 09:36:28,708 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:28,709 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030310900] [2020-12-23 09:36:28,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:28,747 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:36:28,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030310900] [2020-12-23 09:36:28,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:28,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:36:28,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037762530] [2020-12-23 09:36:28,749 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:28,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:28,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:28,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:28,750 INFO L87 Difference]: Start difference. First operand 521 states and 674 transitions. Second operand 3 states. [2020-12-23 09:36:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:28,824 INFO L93 Difference]: Finished difference Result 1005 states and 1299 transitions. [2020-12-23 09:36:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:28,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:36:28,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:28,827 INFO L225 Difference]: With dead ends: 1005 [2020-12-23 09:36:28,828 INFO L226 Difference]: Without dead ends: 497 [2020-12-23 09:36:28,829 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:36:28,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2020-12-23 09:36:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2020-12-23 09:36:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-12-23 09:36:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 626 transitions. [2020-12-23 09:36:28,876 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 626 transitions. Word has length 61 [2020-12-23 09:36:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:28,877 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 626 transitions. [2020-12-23 09:36:28,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 626 transitions. [2020-12-23 09:36:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-23 09:36:28,878 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:28,878 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:36:28,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:36:28,878 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:28,879 INFO L82 PathProgramCache]: Analyzing trace with hash 140559689, now seen corresponding path program 1 times [2020-12-23 09:36:28,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:28,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600950935] [2020-12-23 09:36:28,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:28,915 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:36:28,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600950935] [2020-12-23 09:36:28,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:28,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:28,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50018979] [2020-12-23 09:36:28,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:28,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:28,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:28,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:28,917 INFO L87 Difference]: Start difference. First operand 497 states and 626 transitions. Second operand 3 states. [2020-12-23 09:36:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:29,048 INFO L93 Difference]: Finished difference Result 1368 states and 1714 transitions. [2020-12-23 09:36:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:29,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2020-12-23 09:36:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:29,054 INFO L225 Difference]: With dead ends: 1368 [2020-12-23 09:36:29,054 INFO L226 Difference]: Without dead ends: 920 [2020-12-23 09:36:29,055 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:36:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2020-12-23 09:36:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 891. [2020-12-23 09:36:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2020-12-23 09:36:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1103 transitions. [2020-12-23 09:36:29,160 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1103 transitions. Word has length 61 [2020-12-23 09:36:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:29,161 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1103 transitions. [2020-12-23 09:36:29,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1103 transitions. [2020-12-23 09:36:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-23 09:36:29,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:29,162 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:36:29,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-23 09:36:29,163 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash 327530686, now seen corresponding path program 1 times [2020-12-23 09:36:29,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:29,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133102805] [2020-12-23 09:36:29,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:29,201 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:36:29,202 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133102805] [2020-12-23 09:36:29,202 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:29,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:29,203 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332282445] [2020-12-23 09:36:29,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:29,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:29,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:29,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:29,204 INFO L87 Difference]: Start difference. First operand 891 states and 1103 transitions. Second operand 3 states. [2020-12-23 09:36:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:29,368 INFO L93 Difference]: Finished difference Result 2319 states and 2877 transitions. [2020-12-23 09:36:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:29,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2020-12-23 09:36:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:29,376 INFO L225 Difference]: With dead ends: 2319 [2020-12-23 09:36:29,377 INFO L226 Difference]: Without dead ends: 1522 [2020-12-23 09:36:29,379 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:36:29,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2020-12-23 09:36:29,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1520. [2020-12-23 09:36:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2020-12-23 09:36:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 1870 transitions. [2020-12-23 09:36:29,540 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 1870 transitions. Word has length 62 [2020-12-23 09:36:29,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:29,540 INFO L481 AbstractCegarLoop]: Abstraction has 1520 states and 1870 transitions. [2020-12-23 09:36:29,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 1870 transitions. [2020-12-23 09:36:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 09:36:29,541 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:29,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:36:29,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-23 09:36:29,542 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:29,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:29,543 INFO L82 PathProgramCache]: Analyzing trace with hash -479572275, now seen corresponding path program 1 times [2020-12-23 09:36:29,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:29,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533669092] [2020-12-23 09:36:29,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:29,578 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:36:29,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533669092] [2020-12-23 09:36:29,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:29,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:29,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12102499] [2020-12-23 09:36:29,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:29,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:29,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:29,580 INFO L87 Difference]: Start difference. First operand 1520 states and 1870 transitions. Second operand 3 states. [2020-12-23 09:36:29,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:29,858 INFO L93 Difference]: Finished difference Result 4144 states and 5092 transitions. [2020-12-23 09:36:29,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:29,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-12-23 09:36:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:29,871 INFO L225 Difference]: With dead ends: 4144 [2020-12-23 09:36:29,871 INFO L226 Difference]: Without dead ends: 2718 [2020-12-23 09:36:29,874 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:36:29,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2020-12-23 09:36:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2716. [2020-12-23 09:36:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2716 states. [2020-12-23 09:36:30,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3314 transitions. [2020-12-23 09:36:30,114 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3314 transitions. Word has length 63 [2020-12-23 09:36:30,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:30,114 INFO L481 AbstractCegarLoop]: Abstraction has 2716 states and 3314 transitions. [2020-12-23 09:36:30,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:30,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3314 transitions. [2020-12-23 09:36:30,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-23 09:36:30,116 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:30,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:36:30,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-23 09:36:30,116 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:30,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:30,117 INFO L82 PathProgramCache]: Analyzing trace with hash -45843189, now seen corresponding path program 1 times [2020-12-23 09:36:30,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:30,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692956348] [2020-12-23 09:36:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:30,137 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:36:30,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692956348] [2020-12-23 09:36:30,137 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:30,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:30,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222796172] [2020-12-23 09:36:30,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:30,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:30,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:30,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:30,139 INFO L87 Difference]: Start difference. First operand 2716 states and 3314 transitions. Second operand 3 states. [2020-12-23 09:36:30,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:30,417 INFO L93 Difference]: Finished difference Result 5252 states and 6425 transitions. [2020-12-23 09:36:30,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:30,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-12-23 09:36:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:30,430 INFO L225 Difference]: With dead ends: 5252 [2020-12-23 09:36:30,430 INFO L226 Difference]: Without dead ends: 2630 [2020-12-23 09:36:30,435 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:36:30,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2020-12-23 09:36:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2630. [2020-12-23 09:36:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2020-12-23 09:36:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3216 transitions. [2020-12-23 09:36:30,734 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3216 transitions. Word has length 63 [2020-12-23 09:36:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:30,735 INFO L481 AbstractCegarLoop]: Abstraction has 2630 states and 3216 transitions. [2020-12-23 09:36:30,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3216 transitions. [2020-12-23 09:36:30,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-23 09:36:30,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:30,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:36:30,736 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-23 09:36:30,737 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:30,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:30,737 INFO L82 PathProgramCache]: Analyzing trace with hash -709022745, now seen corresponding path program 1 times [2020-12-23 09:36:30,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:30,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828106367] [2020-12-23 09:36:30,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:30,793 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:36:30,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828106367] [2020-12-23 09:36:30,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:30,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:36:30,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027830188] [2020-12-23 09:36:30,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:30,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:30,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:30,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:30,796 INFO L87 Difference]: Start difference. First operand 2630 states and 3216 transitions. Second operand 3 states. [2020-12-23 09:36:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:31,229 INFO L93 Difference]: Finished difference Result 7634 states and 9339 transitions. [2020-12-23 09:36:31,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:31,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-12-23 09:36:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:31,256 INFO L225 Difference]: With dead ends: 7634 [2020-12-23 09:36:31,256 INFO L226 Difference]: Without dead ends: 5074 [2020-12-23 09:36:31,262 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:36:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5074 states. [2020-12-23 09:36:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5074 to 5042. [2020-12-23 09:36:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5042 states. [2020-12-23 09:36:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5042 states to 5042 states and 6106 transitions. [2020-12-23 09:36:31,740 INFO L78 Accepts]: Start accepts. Automaton has 5042 states and 6106 transitions. Word has length 64 [2020-12-23 09:36:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:31,740 INFO L481 AbstractCegarLoop]: Abstraction has 5042 states and 6106 transitions. [2020-12-23 09:36:31,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 5042 states and 6106 transitions. [2020-12-23 09:36:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-12-23 09:36:31,746 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:31,747 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:36:31,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-23 09:36:31,747 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1717276157, now seen corresponding path program 1 times [2020-12-23 09:36:31,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:31,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565453985] [2020-12-23 09:36:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:36:31,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565453985] [2020-12-23 09:36:31,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:31,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:31,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057638445] [2020-12-23 09:36:31,806 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:31,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:31,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:31,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:31,807 INFO L87 Difference]: Start difference. First operand 5042 states and 6106 transitions. Second operand 4 states. [2020-12-23 09:36:32,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:32,789 INFO L93 Difference]: Finished difference Result 14910 states and 18027 transitions. [2020-12-23 09:36:32,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:32,790 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2020-12-23 09:36:32,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:32,830 INFO L225 Difference]: With dead ends: 14910 [2020-12-23 09:36:32,830 INFO L226 Difference]: Without dead ends: 7496 [2020-12-23 09:36:32,843 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:36:32,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7496 states. [2020-12-23 09:36:33,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7496 to 7496. [2020-12-23 09:36:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7496 states. [2020-12-23 09:36:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7496 states to 7496 states and 9042 transitions. [2020-12-23 09:36:33,539 INFO L78 Accepts]: Start accepts. Automaton has 7496 states and 9042 transitions. Word has length 81 [2020-12-23 09:36:33,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:33,539 INFO L481 AbstractCegarLoop]: Abstraction has 7496 states and 9042 transitions. [2020-12-23 09:36:33,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 7496 states and 9042 transitions. [2020-12-23 09:36:33,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2020-12-23 09:36:33,544 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:33,544 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:36:33,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-23 09:36:33,545 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:33,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:33,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1115959489, now seen corresponding path program 1 times [2020-12-23 09:36:33,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:33,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764407569] [2020-12-23 09:36:33,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:33,599 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-12-23 09:36:33,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764407569] [2020-12-23 09:36:33,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:33,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:36:33,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955114347] [2020-12-23 09:36:33,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:33,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:33,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:33,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:33,602 INFO L87 Difference]: Start difference. First operand 7496 states and 9042 transitions. Second operand 3 states. [2020-12-23 09:36:34,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:34,677 INFO L93 Difference]: Finished difference Result 17102 states and 20603 transitions. [2020-12-23 09:36:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:34,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2020-12-23 09:36:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:34,727 INFO L225 Difference]: With dead ends: 17102 [2020-12-23 09:36:34,727 INFO L226 Difference]: Without dead ends: 9662 [2020-12-23 09:36:34,739 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:36:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9662 states. [2020-12-23 09:36:35,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9662 to 9614. [2020-12-23 09:36:35,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2020-12-23 09:36:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 11518 transitions. [2020-12-23 09:36:35,604 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 11518 transitions. Word has length 110 [2020-12-23 09:36:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:35,604 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 11518 transitions. [2020-12-23 09:36:35,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 11518 transitions. [2020-12-23 09:36:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-23 09:36:35,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:35,612 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:36:35,612 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-23 09:36:35,612 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:35,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:35,613 INFO L82 PathProgramCache]: Analyzing trace with hash 577449217, now seen corresponding path program 1 times [2020-12-23 09:36:35,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:35,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126616383] [2020-12-23 09:36:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:36:35,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126616383] [2020-12-23 09:36:35,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:35,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:35,675 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989352231] [2020-12-23 09:36:35,675 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:35,676 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:35,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:35,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:35,676 INFO L87 Difference]: Start difference. First operand 9614 states and 11518 transitions. Second operand 4 states. [2020-12-23 09:36:36,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:36,576 INFO L93 Difference]: Finished difference Result 17020 states and 20462 transitions. [2020-12-23 09:36:36,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:36,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2020-12-23 09:36:36,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:36,596 INFO L225 Difference]: With dead ends: 17020 [2020-12-23 09:36:36,596 INFO L226 Difference]: Without dead ends: 9616 [2020-12-23 09:36:36,609 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:36:36,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9616 states. [2020-12-23 09:36:37,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9616 to 9614. [2020-12-23 09:36:37,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9614 states. [2020-12-23 09:36:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9614 states to 9614 states and 11476 transitions. [2020-12-23 09:36:37,224 INFO L78 Accepts]: Start accepts. Automaton has 9614 states and 11476 transitions. Word has length 113 [2020-12-23 09:36:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:37,224 INFO L481 AbstractCegarLoop]: Abstraction has 9614 states and 11476 transitions. [2020-12-23 09:36:37,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 9614 states and 11476 transitions. [2020-12-23 09:36:37,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-12-23 09:36:37,232 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:37,233 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-12-23 09:36:37,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-23 09:36:37,233 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:37,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:37,234 INFO L82 PathProgramCache]: Analyzing trace with hash 163247736, now seen corresponding path program 1 times [2020-12-23 09:36:37,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:37,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799212623] [2020-12-23 09:36:37,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-12-23 09:36:37,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799212623] [2020-12-23 09:36:37,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:37,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-23 09:36:37,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652543777] [2020-12-23 09:36:37,320 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:37,320 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:37,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:37,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:37,321 INFO L87 Difference]: Start difference. First operand 9614 states and 11476 transitions. Second operand 3 states. [2020-12-23 09:36:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:37,996 INFO L93 Difference]: Finished difference Result 21076 states and 25107 transitions. [2020-12-23 09:36:37,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:37,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-12-23 09:36:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:38,020 INFO L225 Difference]: With dead ends: 21076 [2020-12-23 09:36:38,020 INFO L226 Difference]: Without dead ends: 11504 [2020-12-23 09:36:38,031 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:36:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11504 states. [2020-12-23 09:36:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11504 to 11440. [2020-12-23 09:36:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-12-23 09:36:38,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13564 transitions. [2020-12-23 09:36:38,696 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13564 transitions. Word has length 142 [2020-12-23 09:36:38,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:38,697 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13564 transitions. [2020-12-23 09:36:38,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:38,697 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13564 transitions. [2020-12-23 09:36:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2020-12-23 09:36:38,709 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:38,709 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:36:38,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-23 09:36:38,709 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:38,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1331585155, now seen corresponding path program 1 times [2020-12-23 09:36:38,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:38,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542513866] [2020-12-23 09:36:38,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:36:38,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542513866] [2020-12-23 09:36:38,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:38,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-23 09:36:38,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86686194] [2020-12-23 09:36:38,855 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-23 09:36:38,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:38,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-23 09:36:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-23 09:36:38,857 INFO L87 Difference]: Start difference. First operand 11440 states and 13564 transitions. Second operand 4 states. [2020-12-23 09:36:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:39,746 INFO L93 Difference]: Finished difference Result 20966 states and 24946 transitions. [2020-12-23 09:36:39,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:36:39,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2020-12-23 09:36:39,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:39,773 INFO L225 Difference]: With dead ends: 20966 [2020-12-23 09:36:39,773 INFO L226 Difference]: Without dead ends: 11442 [2020-12-23 09:36:39,788 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:36:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11442 states. [2020-12-23 09:36:40,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11442 to 11440. [2020-12-23 09:36:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-12-23 09:36:40,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13484 transitions. [2020-12-23 09:36:40,886 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13484 transitions. Word has length 145 [2020-12-23 09:36:40,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:40,887 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13484 transitions. [2020-12-23 09:36:40,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-23 09:36:40,887 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13484 transitions. [2020-12-23 09:36:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2020-12-23 09:36:40,898 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:40,898 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:40,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-23 09:36:40,899 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:40,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:40,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1031093230, now seen corresponding path program 1 times [2020-12-23 09:36:40,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:40,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213629881] [2020-12-23 09:36:40,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:40,961 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:36:40,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213629881] [2020-12-23 09:36:40,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:40,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:40,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959882599] [2020-12-23 09:36:40,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:40,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:40,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:40,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:40,964 INFO L87 Difference]: Start difference. First operand 11440 states and 13484 transitions. Second operand 3 states. [2020-12-23 09:36:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:41,576 INFO L93 Difference]: Finished difference Result 19782 states and 23399 transitions. [2020-12-23 09:36:41,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:41,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2020-12-23 09:36:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:41,597 INFO L225 Difference]: With dead ends: 19782 [2020-12-23 09:36:41,598 INFO L226 Difference]: Without dead ends: 11472 [2020-12-23 09:36:41,612 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:36:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11472 states. [2020-12-23 09:36:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11472 to 11440. [2020-12-23 09:36:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11440 states. [2020-12-23 09:36:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11440 states to 11440 states and 13276 transitions. [2020-12-23 09:36:42,625 INFO L78 Accepts]: Start accepts. Automaton has 11440 states and 13276 transitions. Word has length 174 [2020-12-23 09:36:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:42,625 INFO L481 AbstractCegarLoop]: Abstraction has 11440 states and 13276 transitions. [2020-12-23 09:36:42,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11440 states and 13276 transitions. [2020-12-23 09:36:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2020-12-23 09:36:42,636 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:42,636 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:42,636 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-23 09:36:42,636 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:42,637 INFO L82 PathProgramCache]: Analyzing trace with hash 807546521, now seen corresponding path program 1 times [2020-12-23 09:36:42,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:42,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606973417] [2020-12-23 09:36:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:42,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:36:42,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606973417] [2020-12-23 09:36:42,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:42,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:42,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988523835] [2020-12-23 09:36:42,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:42,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:42,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:42,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:42,711 INFO L87 Difference]: Start difference. First operand 11440 states and 13276 transitions. Second operand 3 states. [2020-12-23 09:36:43,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:43,318 INFO L93 Difference]: Finished difference Result 18390 states and 21415 transitions. [2020-12-23 09:36:43,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:43,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2020-12-23 09:36:43,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:43,336 INFO L225 Difference]: With dead ends: 18390 [2020-12-23 09:36:43,336 INFO L226 Difference]: Without dead ends: 11440 [2020-12-23 09:36:43,346 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:36:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11440 states. [2020-12-23 09:36:44,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11440 to 11410. [2020-12-23 09:36:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11410 states. [2020-12-23 09:36:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11410 states to 11410 states and 13082 transitions. [2020-12-23 09:36:44,057 INFO L78 Accepts]: Start accepts. Automaton has 11410 states and 13082 transitions. Word has length 176 [2020-12-23 09:36:44,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:44,058 INFO L481 AbstractCegarLoop]: Abstraction has 11410 states and 13082 transitions. [2020-12-23 09:36:44,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 11410 states and 13082 transitions. [2020-12-23 09:36:44,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2020-12-23 09:36:44,067 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:44,067 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:44,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-23 09:36:44,068 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:44,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:44,068 INFO L82 PathProgramCache]: Analyzing trace with hash 251088387, now seen corresponding path program 1 times [2020-12-23 09:36:44,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:44,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744028689] [2020-12-23 09:36:44,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:44,153 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-12-23 09:36:44,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744028689] [2020-12-23 09:36:44,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:44,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:44,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462488389] [2020-12-23 09:36:44,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:44,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:44,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:44,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:44,156 INFO L87 Difference]: Start difference. First operand 11410 states and 13082 transitions. Second operand 3 states. [2020-12-23 09:36:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:44,758 INFO L93 Difference]: Finished difference Result 22664 states and 25781 transitions. [2020-12-23 09:36:44,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:44,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2020-12-23 09:36:44,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:44,769 INFO L225 Difference]: With dead ends: 22664 [2020-12-23 09:36:44,769 INFO L226 Difference]: Without dead ends: 6788 [2020-12-23 09:36:44,783 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:36:44,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6788 states. [2020-12-23 09:36:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6788 to 6580. [2020-12-23 09:36:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6580 states. [2020-12-23 09:36:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 7246 transitions. [2020-12-23 09:36:45,302 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 7246 transitions. Word has length 178 [2020-12-23 09:36:45,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:45,302 INFO L481 AbstractCegarLoop]: Abstraction has 6580 states and 7246 transitions. [2020-12-23 09:36:45,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 7246 transitions. [2020-12-23 09:36:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-12-23 09:36:45,310 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:45,311 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:45,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-23 09:36:45,311 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:45,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:45,312 INFO L82 PathProgramCache]: Analyzing trace with hash -32931800, now seen corresponding path program 1 times [2020-12-23 09:36:45,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:45,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216167966] [2020-12-23 09:36:45,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:36:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:36:45,480 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216167966] [2020-12-23 09:36:45,480 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:36:45,480 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-23 09:36:45,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923519861] [2020-12-23 09:36:45,481 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-23 09:36:45,481 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:36:45,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-23 09:36:45,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-23 09:36:45,482 INFO L87 Difference]: Start difference. First operand 6580 states and 7246 transitions. Second operand 3 states. [2020-12-23 09:36:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:36:45,956 INFO L93 Difference]: Finished difference Result 11554 states and 12749 transitions. [2020-12-23 09:36:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-23 09:36:45,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-12-23 09:36:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:36:45,963 INFO L225 Difference]: With dead ends: 11554 [2020-12-23 09:36:45,964 INFO L226 Difference]: Without dead ends: 6580 [2020-12-23 09:36:45,968 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:36:45,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6580 states. [2020-12-23 09:36:46,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6580 to 6580. [2020-12-23 09:36:46,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6580 states. [2020-12-23 09:36:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 7168 transitions. [2020-12-23 09:36:46,475 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 7168 transitions. Word has length 180 [2020-12-23 09:36:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:36:46,476 INFO L481 AbstractCegarLoop]: Abstraction has 6580 states and 7168 transitions. [2020-12-23 09:36:46,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-23 09:36:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 7168 transitions. [2020-12-23 09:36:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2020-12-23 09:36:46,482 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:36:46,482 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:46,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-12-23 09:36:46,483 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:36:46,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:36:46,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1382104249, now seen corresponding path program 1 times [2020-12-23 09:36:46,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:36:46,483 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385105682] [2020-12-23 09:36:46,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:36:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:36:46,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:36:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:36:46,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:36:46,628 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 09:36:46,628 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 09:36:46,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-12-23 09:36:46,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:36:46 BoogieIcfgContainer [2020-12-23 09:36:46,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:36:46,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:36:46,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:36:46,878 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:36:46,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:36:25" (3/4) ... [2020-12-23 09:36:46,881 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 09:36:47,135 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/transmitter.03.cil.c-witness.graphml [2020-12-23 09:36:47,136 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:36:47,138 INFO L168 Benchmark]: Toolchain (without parser) took 22901.43 ms. Allocated memory was 154.1 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 129.4 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 792.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:47,139 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 154.1 MB. Free memory was 126.9 MB in the beginning and 126.8 MB in the end (delta: 84.5 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:36:47,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.42 ms. Allocated memory is still 154.1 MB. Free memory was 129.3 MB in the beginning and 114.5 MB in the end (delta: 14.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:47,140 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.57 ms. Allocated memory is still 154.1 MB. Free memory was 114.5 MB in the beginning and 111.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:47,141 INFO L168 Benchmark]: Boogie Preprocessor took 85.60 ms. Allocated memory is still 154.1 MB. Free memory was 111.1 MB in the beginning and 108.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:47,141 INFO L168 Benchmark]: RCFGBuilder took 1092.61 ms. Allocated memory is still 154.1 MB. Free memory was 108.0 MB in the beginning and 74.4 MB in the end (delta: 33.6 MB). Peak memory consumption was 32.8 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:47,142 INFO L168 Benchmark]: TraceAbstraction took 20946.75 ms. Allocated memory was 154.1 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 74.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 708.5 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:47,142 INFO L168 Benchmark]: Witness Printer took 257.84 ms. Allocated memory is still 2.9 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. [2020-12-23 09:36:47,148 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.18 ms. Allocated memory is still 154.1 MB. Free memory was 126.9 MB in the beginning and 126.8 MB in the end (delta: 84.5 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 443.42 ms. Allocated memory is still 154.1 MB. Free memory was 129.3 MB in the beginning and 114.5 MB in the end (delta: 14.8 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 66.57 ms. Allocated memory is still 154.1 MB. Free memory was 114.5 MB in the beginning and 111.1 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 85.60 ms. Allocated memory is still 154.1 MB. Free memory was 111.1 MB in the beginning and 108.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1092.61 ms. Allocated memory is still 154.1 MB. Free memory was 108.0 MB in the beginning and 74.4 MB in the end (delta: 33.6 MB). Peak memory consumption was 32.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 20946.75 ms. Allocated memory was 154.1 MB in the beginning and 2.9 GB in the end (delta: 2.7 GB). Free memory was 74.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 708.5 MB. Max. memory is 8.0 GB. * Witness Printer took 257.84 ms. Allocated memory is still 2.9 GB. Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: 28.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int t3_pc = 0; [L21] int m_st ; [L22] int t1_st ; [L23] int t2_st ; [L24] int t3_st ; [L25] int m_i ; [L26] int t1_i ; [L27] int t2_i ; [L28] int t3_i ; [L29] int M_E = 2; [L30] int T1_E = 2; [L31] int T2_E = 2; [L32] int T3_E = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; VAL [E_1=2, E_2=2, E_3=2, 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] [L689] int __retres1 ; [L602] m_i = 1 [L603] t1_i = 1 [L604] t2_i = 1 [L605] t3_i = 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L630] int kernel_st ; [L631] int tmp ; [L632] int tmp___0 ; [L636] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L273] COND TRUE m_i == 1 [L274] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L278] COND TRUE t1_i == 1 [L279] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L283] COND TRUE t2_i == 1 [L284] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L288] COND TRUE t3_i == 1 [L289] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L410] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, 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] [L415] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, 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] [L420] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, 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] [L425] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, 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] [L430] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, 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] [L435] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, 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] [L440] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, 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] [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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] [L189] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, 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] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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] [L208] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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] [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, 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] [L224] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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] [L227] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L237] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L239] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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] [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, 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] [L243] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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] [L246] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L256] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L258] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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] [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, 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] [L453] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L458] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L463] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L468] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L473] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L478] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L483] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, 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] [L644] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L647] kernel_st = 1 [L329] int tmp ; VAL [E_1=2, E_2=2, E_3=2, 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] [L333] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L298] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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] [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L324] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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] [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, 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] [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, 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] [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp_ndt_2) [L362] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L86] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L97] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L99] t1_pc = 1 [L100] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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] [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp_ndt_3) [L376] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L121] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L132] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L134] t2_pc = 1 [L135] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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] [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND TRUE \read(tmp_ndt_4) [L390] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L156] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L167] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L169] t3_pc = 1 [L170] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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] [L333] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L298] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, 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] [L301] COND TRUE m_st == 0 [L302] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L324] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, 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] [L336] tmp = exists_runnable_thread() [L338] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, 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] [L343] COND TRUE m_st == 0 [L344] int tmp_ndt_1; [L345] tmp_ndt_1 = __VERIFIER_nondet_int() [L346] COND TRUE \read(tmp_ndt_1) [L348] m_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L45] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, 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] [L56] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L59] E_1 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, 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] [L189] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, 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] [L199] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, 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] [L201] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, 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] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, 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] [L205] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, 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] [L208] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, 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] [L209] COND TRUE E_1 == 1 [L210] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, 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] [L220] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, 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] [L508] tmp___0 = is_transmit1_triggered() [L510] COND TRUE \read(tmp___0) [L511] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, 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] [L224] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, 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] [L227] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, 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] [L228] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, 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] [L237] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, 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] [L239] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, 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] [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, 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] [L243] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, 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] [L246] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, 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] [L247] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, 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] [L256] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, 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] [L258] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, 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] [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, 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] [L61] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, 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] [L64] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L66] m_pc = 1 [L67] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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] [L357] COND TRUE t1_st == 0 [L358] int tmp_ndt_2; [L359] tmp_ndt_2 = __VERIFIER_nondet_int() [L360] COND TRUE \read(tmp_ndt_2) [L362] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L86] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, 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] [L89] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L105] E_2 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, 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] [L189] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, 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] [L190] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=2, 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] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, 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] [L201] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, 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] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, 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] [L205] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, 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] [L208] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, 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] [L209] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, 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] [L218] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, 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] [L220] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, 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] [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, 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] [L224] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, 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] [L227] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, 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] [L228] COND TRUE E_2 == 1 [L229] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, 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] [L239] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, 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] [L516] tmp___1 = is_transmit2_triggered() [L518] COND TRUE \read(tmp___1) [L519] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, 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] [L243] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, 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] [L246] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, 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] [L247] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, 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] [L256] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, 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] [L258] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, 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] [L524] tmp___2 = is_transmit3_triggered() [L526] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, 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] [L107] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, 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] [L97] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L99] t1_pc = 1 [L100] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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] [L371] COND TRUE t2_st == 0 [L372] int tmp_ndt_3; [L373] tmp_ndt_3 = __VERIFIER_nondet_int() [L374] COND TRUE \read(tmp_ndt_3) [L376] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L121] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, 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] [L124] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L140] E_3 = 1 [L493] int tmp ; [L494] int tmp___0 ; [L495] int tmp___1 ; [L496] int tmp___2 ; [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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] [L189] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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] [L190] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, 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] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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] [L500] tmp = is_master_triggered() [L502] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, 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] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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] [L208] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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] [L209] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, 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] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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] [L508] tmp___0 = is_transmit1_triggered() [L510] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, 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] [L224] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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] [L227] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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] [L228] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, 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] [L237] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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] [L239] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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] [L516] tmp___1 = is_transmit2_triggered() [L518] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, 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] [L243] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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] [L246] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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] [L247] COND TRUE E_3 == 1 [L248] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, 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] [L258] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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] [L524] tmp___2 = is_transmit3_triggered() [L526] COND TRUE \read(tmp___2) [L527] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, 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] [L142] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, 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] [L132] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L134] t2_pc = 1 [L135] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, 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] [L385] COND TRUE t3_st == 0 [L386] int tmp_ndt_4; [L387] tmp_ndt_4 = __VERIFIER_nondet_int() [L388] COND TRUE \read(tmp_ndt_4) [L390] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L156] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, 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] [L159] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, 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] [L13] reach_error() VAL [E_1=2, E_2=2, E_3=2, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 276 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 20.6s, OverallIterations: 27, TraceHistogramMax: 2, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10841 SDtfs, 11167 SDslu, 8647 SDs, 0 SdLazy, 600 SolverSat, 245 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11440occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 2370 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2526 NumberOfCodeBlocks, 2526 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2318 ConstructedInterpolants, 0 QuantifiedInterpolants, 405898 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 171/171 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...