/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:24:46,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:24:46,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:24:46,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:24:46,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:24:46,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:24:46,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:24:46,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:24:46,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:24:46,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:24:46,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:24:46,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:24:46,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:24:46,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:24:46,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:24:46,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:24:46,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:24:46,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:24:46,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:24:46,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:24:46,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:24:46,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:24:46,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:24:46,204 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:24:46,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:24:46,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:24:46,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:24:46,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:24:46,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:24:46,236 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:24:46,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:24:46,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:24:46,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:24:46,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:24:46,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:24:46,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:24:46,243 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:24:46,248 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:24:46,248 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:24:46,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:24:46,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:24:46,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:24:46,306 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:24:46,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:24:46,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:24:46,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:24:46,312 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:24:46,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:24:46,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:24:46,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:24:46,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:24:46,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:24:46,314 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:24:46,314 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:24:46,314 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:24:46,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:24:46,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:24:46,315 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:24:46,315 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:24:46,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:24:46,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:24:46,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:24:46,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:24:46,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:24:46,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:24:46,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:24:46,316 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:24:46,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:24:46,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:24:46,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:24:46,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:24:46,725 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:24:46,726 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:24:46,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-01-06 19:24:46,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/efae58be3/6627b448953d4edd8804451667ecb2b4/FLAG96c1eedf6 [2021-01-06 19:24:47,386 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:24:47,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2021-01-06 19:24:47,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/efae58be3/6627b448953d4edd8804451667ecb2b4/FLAG96c1eedf6 [2021-01-06 19:24:47,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/efae58be3/6627b448953d4edd8804451667ecb2b4 [2021-01-06 19:24:47,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:24:47,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:24:47,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:24:47,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:24:47,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:24:47,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:24:47" (1/1) ... [2021-01-06 19:24:47,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fa3416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:47, skipping insertion in model container [2021-01-06 19:24:47,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:24:47" (1/1) ... [2021-01-06 19:24:47,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:24:47,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:24:47,957 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~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[~__retres1~2,] 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[~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[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~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[~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~3,] [2021-01-06 19:24:48,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:24:48,036 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:24:48,050 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~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[~__retres1~2,] 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[~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[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~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[~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~3,] [2021-01-06 19:24:48,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:24:48,106 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:24:48,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48 WrapperNode [2021-01-06 19:24:48,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:24:48,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:24:48,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:24:48,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:24:48,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (1/1) ... [2021-01-06 19:24:48,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (1/1) ... [2021-01-06 19:24:48,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:24:48,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:24:48,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:24:48,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:24:48,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (1/1) ... [2021-01-06 19:24:48,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (1/1) ... [2021-01-06 19:24:48,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (1/1) ... [2021-01-06 19:24:48,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (1/1) ... [2021-01-06 19:24:48,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (1/1) ... [2021-01-06 19:24:48,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (1/1) ... [2021-01-06 19:24:48,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (1/1) ... [2021-01-06 19:24:48,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:24:48,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:24:48,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:24:48,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:24:48,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:24:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:24:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:24:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:24:48,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:24:49,240 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:24:49,242 INFO L299 CfgBuilder]: Removed 80 assume(true) statements. [2021-01-06 19:24:49,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:24:49 BoogieIcfgContainer [2021-01-06 19:24:49,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:24:49,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:24:49,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:24:49,266 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:24:49,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:24:47" (1/3) ... [2021-01-06 19:24:49,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ad1b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:24:49, skipping insertion in model container [2021-01-06 19:24:49,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:48" (2/3) ... [2021-01-06 19:24:49,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ad1b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:24:49, skipping insertion in model container [2021-01-06 19:24:49,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:24:49" (3/3) ... [2021-01-06 19:24:49,276 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2021-01-06 19:24:49,292 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:24:49,306 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:24:49,327 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:24:49,357 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:24:49,357 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:24:49,357 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:24:49,357 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:24:49,358 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:24:49,358 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:24:49,358 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:24:49,358 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:24:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2021-01-06 19:24:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:49,387 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:49,396 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] [2021-01-06 19:24:49,397 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:49,406 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2021-01-06 19:24:49,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:49,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614349062] [2021-01-06 19:24:49,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:49,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614349062] [2021-01-06 19:24:49,632 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:49,632 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:49,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762155205] [2021-01-06 19:24:49,639 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:49,639 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:49,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:49,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:49,658 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2021-01-06 19:24:49,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:49,729 INFO L93 Difference]: Finished difference Result 277 states and 431 transitions. [2021-01-06 19:24:49,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:49,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 19:24:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:49,762 INFO L225 Difference]: With dead ends: 277 [2021-01-06 19:24:49,762 INFO L226 Difference]: Without dead ends: 137 [2021-01-06 19:24:49,772 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:49,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-01-06 19:24:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-01-06 19:24:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2021-01-06 19:24:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2021-01-06 19:24:49,875 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 39 [2021-01-06 19:24:49,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:49,876 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2021-01-06 19:24:49,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:49,876 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2021-01-06 19:24:49,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:49,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:49,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] [2021-01-06 19:24:49,879 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:24:49,880 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:49,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:49,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2021-01-06 19:24:49,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:49,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243667446] [2021-01-06 19:24:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:49,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243667446] [2021-01-06 19:24:49,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:49,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:24:49,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821998077] [2021-01-06 19:24:49,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:49,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:49,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:49,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:49,968 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 3 states. [2021-01-06 19:24:50,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:50,088 INFO L93 Difference]: Finished difference Result 363 states and 543 transitions. [2021-01-06 19:24:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:50,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 19:24:50,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:50,096 INFO L225 Difference]: With dead ends: 363 [2021-01-06 19:24:50,096 INFO L226 Difference]: Without dead ends: 232 [2021-01-06 19:24:50,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2021-01-06 19:24:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2021-01-06 19:24:50,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 19:24:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 341 transitions. [2021-01-06 19:24:50,161 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 341 transitions. Word has length 39 [2021-01-06 19:24:50,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:50,165 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 341 transitions. [2021-01-06 19:24:50,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:50,165 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 341 transitions. [2021-01-06 19:24:50,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:50,167 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:50,167 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] [2021-01-06 19:24:50,168 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:24:50,169 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2021-01-06 19:24:50,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:50,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772068854] [2021-01-06 19:24:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:50,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772068854] [2021-01-06 19:24:50,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:50,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:50,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493426124] [2021-01-06 19:24:50,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:50,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:50,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:50,296 INFO L87 Difference]: Start difference. First operand 230 states and 341 transitions. Second operand 4 states. [2021-01-06 19:24:50,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:50,462 INFO L93 Difference]: Finished difference Result 547 states and 810 transitions. [2021-01-06 19:24:50,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:50,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-01-06 19:24:50,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:50,468 INFO L225 Difference]: With dead ends: 547 [2021-01-06 19:24:50,468 INFO L226 Difference]: Without dead ends: 324 [2021-01-06 19:24:50,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:50,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-01-06 19:24:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 230. [2021-01-06 19:24:50,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 19:24:50,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 338 transitions. [2021-01-06 19:24:50,517 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 338 transitions. Word has length 39 [2021-01-06 19:24:50,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:50,523 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 338 transitions. [2021-01-06 19:24:50,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:50,524 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 338 transitions. [2021-01-06 19:24:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:50,527 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:50,527 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] [2021-01-06 19:24:50,529 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:24:50,529 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:50,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:50,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1582653462, now seen corresponding path program 1 times [2021-01-06 19:24:50,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:50,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550681616] [2021-01-06 19:24:50,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:50,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550681616] [2021-01-06 19:24:50,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:50,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:24:50,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942723337] [2021-01-06 19:24:50,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:50,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:50,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:50,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:50,626 INFO L87 Difference]: Start difference. First operand 230 states and 338 transitions. Second operand 3 states. [2021-01-06 19:24:50,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:50,715 INFO L93 Difference]: Finished difference Result 452 states and 666 transitions. [2021-01-06 19:24:50,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:50,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 19:24:50,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:50,718 INFO L225 Difference]: With dead ends: 452 [2021-01-06 19:24:50,718 INFO L226 Difference]: Without dead ends: 230 [2021-01-06 19:24:50,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:50,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2021-01-06 19:24:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2021-01-06 19:24:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 19:24:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2021-01-06 19:24:50,735 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2021-01-06 19:24:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:50,735 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2021-01-06 19:24:50,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2021-01-06 19:24:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:50,736 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:50,737 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] [2021-01-06 19:24:50,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:24:50,737 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:50,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:50,738 INFO L82 PathProgramCache]: Analyzing trace with hash 836344722, now seen corresponding path program 1 times [2021-01-06 19:24:50,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:50,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939738248] [2021-01-06 19:24:50,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:50,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939738248] [2021-01-06 19:24:50,784 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:50,784 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:50,784 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536341284] [2021-01-06 19:24:50,785 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:50,785 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:50,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:50,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:50,786 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand 4 states. [2021-01-06 19:24:50,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:50,928 INFO L93 Difference]: Finished difference Result 529 states and 746 transitions. [2021-01-06 19:24:50,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:50,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-01-06 19:24:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:50,931 INFO L225 Difference]: With dead ends: 529 [2021-01-06 19:24:50,931 INFO L226 Difference]: Without dead ends: 308 [2021-01-06 19:24:50,932 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:50,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-01-06 19:24:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 230. [2021-01-06 19:24:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2021-01-06 19:24:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 321 transitions. [2021-01-06 19:24:50,950 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 321 transitions. Word has length 39 [2021-01-06 19:24:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:50,950 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 321 transitions. [2021-01-06 19:24:50,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 321 transitions. [2021-01-06 19:24:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:50,951 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:50,952 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] [2021-01-06 19:24:50,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:24:50,952 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:50,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:50,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1537944596, now seen corresponding path program 1 times [2021-01-06 19:24:50,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:50,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665362325] [2021-01-06 19:24:50,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:50,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:50,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665362325] [2021-01-06 19:24:50,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:50,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:50,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236385686] [2021-01-06 19:24:50,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:50,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:50,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:50,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:51,000 INFO L87 Difference]: Start difference. First operand 230 states and 321 transitions. Second operand 4 states. [2021-01-06 19:24:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:51,202 INFO L93 Difference]: Finished difference Result 784 states and 1096 transitions. [2021-01-06 19:24:51,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:51,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-01-06 19:24:51,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:51,211 INFO L225 Difference]: With dead ends: 784 [2021-01-06 19:24:51,211 INFO L226 Difference]: Without dead ends: 565 [2021-01-06 19:24:51,212 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:51,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2021-01-06 19:24:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 519. [2021-01-06 19:24:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2021-01-06 19:24:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 712 transitions. [2021-01-06 19:24:51,252 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 712 transitions. Word has length 39 [2021-01-06 19:24:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:51,254 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 712 transitions. [2021-01-06 19:24:51,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 712 transitions. [2021-01-06 19:24:51,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 19:24:51,260 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:51,260 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:24:51,260 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:24:51,261 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:51,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:51,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1363148020, now seen corresponding path program 1 times [2021-01-06 19:24:51,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:51,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996671955] [2021-01-06 19:24:51,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:24:51,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996671955] [2021-01-06 19:24:51,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:51,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:24:51,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736276677] [2021-01-06 19:24:51,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:24:51,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:51,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:24:51,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:51,375 INFO L87 Difference]: Start difference. First operand 519 states and 712 transitions. Second operand 5 states. [2021-01-06 19:24:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:51,595 INFO L93 Difference]: Finished difference Result 1311 states and 1809 transitions. [2021-01-06 19:24:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:24:51,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-01-06 19:24:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:51,600 INFO L225 Difference]: With dead ends: 1311 [2021-01-06 19:24:51,600 INFO L226 Difference]: Without dead ends: 813 [2021-01-06 19:24:51,602 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:24:51,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-01-06 19:24:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 540. [2021-01-06 19:24:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2021-01-06 19:24:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 724 transitions. [2021-01-06 19:24:51,660 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 724 transitions. Word has length 51 [2021-01-06 19:24:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:51,661 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 724 transitions. [2021-01-06 19:24:51,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:24:51,661 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 724 transitions. [2021-01-06 19:24:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 19:24:51,662 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:51,662 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:24:51,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:24:51,662 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:51,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:51,663 INFO L82 PathProgramCache]: Analyzing trace with hash -661548146, now seen corresponding path program 1 times [2021-01-06 19:24:51,663 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:51,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938626569] [2021-01-06 19:24:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:51,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:24:51,706 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938626569] [2021-01-06 19:24:51,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:51,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:51,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279725676] [2021-01-06 19:24:51,707 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:51,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:51,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:51,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:51,709 INFO L87 Difference]: Start difference. First operand 540 states and 724 transitions. Second operand 4 states. [2021-01-06 19:24:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:51,830 INFO L93 Difference]: Finished difference Result 1284 states and 1724 transitions. [2021-01-06 19:24:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:51,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-01-06 19:24:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:51,836 INFO L225 Difference]: With dead ends: 1284 [2021-01-06 19:24:51,836 INFO L226 Difference]: Without dead ends: 767 [2021-01-06 19:24:51,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:51,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2021-01-06 19:24:51,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 540. [2021-01-06 19:24:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2021-01-06 19:24:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 711 transitions. [2021-01-06 19:24:51,881 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 711 transitions. Word has length 51 [2021-01-06 19:24:51,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:51,881 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 711 transitions. [2021-01-06 19:24:51,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 711 transitions. [2021-01-06 19:24:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 19:24:51,882 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:51,882 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:24:51,883 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:24:51,883 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:51,883 INFO L82 PathProgramCache]: Analyzing trace with hash 724655248, now seen corresponding path program 1 times [2021-01-06 19:24:51,884 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:51,884 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605540708] [2021-01-06 19:24:51,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:51,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605540708] [2021-01-06 19:24:51,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:51,929 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:51,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497783167] [2021-01-06 19:24:51,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:51,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:51,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:51,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:51,930 INFO L87 Difference]: Start difference. First operand 540 states and 711 transitions. Second operand 3 states. [2021-01-06 19:24:52,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:52,063 INFO L93 Difference]: Finished difference Result 1511 states and 1975 transitions. [2021-01-06 19:24:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:52,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2021-01-06 19:24:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:52,070 INFO L225 Difference]: With dead ends: 1511 [2021-01-06 19:24:52,070 INFO L226 Difference]: Without dead ends: 996 [2021-01-06 19:24:52,072 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:52,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2021-01-06 19:24:52,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 960. [2021-01-06 19:24:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2021-01-06 19:24:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1226 transitions. [2021-01-06 19:24:52,173 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1226 transitions. Word has length 51 [2021-01-06 19:24:52,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:52,174 INFO L481 AbstractCegarLoop]: Abstraction has 960 states and 1226 transitions. [2021-01-06 19:24:52,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1226 transitions. [2021-01-06 19:24:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 19:24:52,175 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:52,175 INFO L422 BasicCegarLoop]: trace histogram [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] [2021-01-06 19:24:52,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:24:52,175 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:52,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:52,176 INFO L82 PathProgramCache]: Analyzing trace with hash 171160657, now seen corresponding path program 1 times [2021-01-06 19:24:52,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:52,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140553705] [2021-01-06 19:24:52,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:52,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:24:52,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140553705] [2021-01-06 19:24:52,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:52,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:24:52,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499408719] [2021-01-06 19:24:52,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:52,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:52,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:52,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:52,221 INFO L87 Difference]: Start difference. First operand 960 states and 1226 transitions. Second operand 3 states. [2021-01-06 19:24:52,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:52,387 INFO L93 Difference]: Finished difference Result 2284 states and 2945 transitions. [2021-01-06 19:24:52,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:52,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2021-01-06 19:24:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:52,397 INFO L225 Difference]: With dead ends: 2284 [2021-01-06 19:24:52,397 INFO L226 Difference]: Without dead ends: 1602 [2021-01-06 19:24:52,399 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2021-01-06 19:24:52,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1312. [2021-01-06 19:24:52,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2021-01-06 19:24:52,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1678 transitions. [2021-01-06 19:24:52,508 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1678 transitions. Word has length 52 [2021-01-06 19:24:52,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:52,508 INFO L481 AbstractCegarLoop]: Abstraction has 1312 states and 1678 transitions. [2021-01-06 19:24:52,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:52,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1678 transitions. [2021-01-06 19:24:52,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:24:52,510 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:52,510 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:52,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:24:52,510 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash 313852773, now seen corresponding path program 1 times [2021-01-06 19:24:52,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:52,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744888233] [2021-01-06 19:24:52,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:52,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744888233] [2021-01-06 19:24:52,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:52,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:24:52,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025674610] [2021-01-06 19:24:52,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:24:52,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:24:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:52,561 INFO L87 Difference]: Start difference. First operand 1312 states and 1678 transitions. Second operand 5 states. [2021-01-06 19:24:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:52,818 INFO L93 Difference]: Finished difference Result 2538 states and 3250 transitions. [2021-01-06 19:24:52,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:24:52,819 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2021-01-06 19:24:52,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:52,827 INFO L225 Difference]: With dead ends: 2538 [2021-01-06 19:24:52,827 INFO L226 Difference]: Without dead ends: 1554 [2021-01-06 19:24:52,830 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:24:52,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2021-01-06 19:24:52,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1324. [2021-01-06 19:24:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2021-01-06 19:24:52,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1656 transitions. [2021-01-06 19:24:52,949 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1656 transitions. Word has length 63 [2021-01-06 19:24:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:52,949 INFO L481 AbstractCegarLoop]: Abstraction has 1324 states and 1656 transitions. [2021-01-06 19:24:52,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:24:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1656 transitions. [2021-01-06 19:24:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:24:52,951 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:52,951 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:52,951 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:24:52,951 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:52,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:52,952 INFO L82 PathProgramCache]: Analyzing trace with hash 736554599, now seen corresponding path program 1 times [2021-01-06 19:24:52,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:52,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122121996] [2021-01-06 19:24:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:52,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122121996] [2021-01-06 19:24:52,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:52,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:52,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398044069] [2021-01-06 19:24:52,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:52,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:52,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:52,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:52,995 INFO L87 Difference]: Start difference. First operand 1324 states and 1656 transitions. Second operand 3 states. [2021-01-06 19:24:53,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:53,249 INFO L93 Difference]: Finished difference Result 3688 states and 4602 transitions. [2021-01-06 19:24:53,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:53,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:24:53,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:53,262 INFO L225 Difference]: With dead ends: 3688 [2021-01-06 19:24:53,262 INFO L226 Difference]: Without dead ends: 2410 [2021-01-06 19:24:53,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2410 states. [2021-01-06 19:24:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2410 to 2384. [2021-01-06 19:24:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2384 states. [2021-01-06 19:24:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2384 states to 2384 states and 2930 transitions. [2021-01-06 19:24:53,466 INFO L78 Accepts]: Start accepts. Automaton has 2384 states and 2930 transitions. Word has length 63 [2021-01-06 19:24:53,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:53,467 INFO L481 AbstractCegarLoop]: Abstraction has 2384 states and 2930 transitions. [2021-01-06 19:24:53,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:53,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states and 2930 transitions. [2021-01-06 19:24:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 19:24:53,469 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:53,469 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:53,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:24:53,469 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:53,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:53,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1397696040, now seen corresponding path program 1 times [2021-01-06 19:24:53,470 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:53,470 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467918557] [2021-01-06 19:24:53,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:53,553 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:53,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467918557] [2021-01-06 19:24:53,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:53,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:53,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092688377] [2021-01-06 19:24:53,554 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:53,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:53,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:53,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:53,557 INFO L87 Difference]: Start difference. First operand 2384 states and 2930 transitions. Second operand 4 states. [2021-01-06 19:24:53,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:53,831 INFO L93 Difference]: Finished difference Result 4190 states and 5144 transitions. [2021-01-06 19:24:53,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:53,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-01-06 19:24:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:53,841 INFO L225 Difference]: With dead ends: 4190 [2021-01-06 19:24:53,842 INFO L226 Difference]: Without dead ends: 1831 [2021-01-06 19:24:53,845 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 [2021-01-06 19:24:53,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2021-01-06 19:24:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2021-01-06 19:24:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2021-01-06 19:24:54,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2207 transitions. [2021-01-06 19:24:54,003 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2207 transitions. Word has length 64 [2021-01-06 19:24:54,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:54,004 INFO L481 AbstractCegarLoop]: Abstraction has 1829 states and 2207 transitions. [2021-01-06 19:24:54,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2207 transitions. [2021-01-06 19:24:54,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:24:54,006 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:54,006 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-01-06 19:24:54,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:24:54,007 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:54,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:54,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1733249900, now seen corresponding path program 1 times [2021-01-06 19:24:54,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:54,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781665110] [2021-01-06 19:24:54,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:24:54,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781665110] [2021-01-06 19:24:54,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:54,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:54,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420964804] [2021-01-06 19:24:54,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:54,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:54,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:54,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:54,055 INFO L87 Difference]: Start difference. First operand 1829 states and 2207 transitions. Second operand 4 states. [2021-01-06 19:24:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:54,304 INFO L93 Difference]: Finished difference Result 3657 states and 4409 transitions. [2021-01-06 19:24:54,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:54,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2021-01-06 19:24:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:54,314 INFO L225 Difference]: With dead ends: 3657 [2021-01-06 19:24:54,314 INFO L226 Difference]: Without dead ends: 1586 [2021-01-06 19:24:54,318 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 [2021-01-06 19:24:54,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2021-01-06 19:24:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1559. [2021-01-06 19:24:54,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1559 states. [2021-01-06 19:24:54,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 1866 transitions. [2021-01-06 19:24:54,455 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 1866 transitions. Word has length 94 [2021-01-06 19:24:54,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:54,456 INFO L481 AbstractCegarLoop]: Abstraction has 1559 states and 1866 transitions. [2021-01-06 19:24:54,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 1866 transitions. [2021-01-06 19:24:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:24:54,458 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:54,458 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 19:24:54,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:24:54,459 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash -41173677, now seen corresponding path program 1 times [2021-01-06 19:24:54,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:54,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533554321] [2021-01-06 19:24:54,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:24:54,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533554321] [2021-01-06 19:24:54,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:54,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:54,519 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23647366] [2021-01-06 19:24:54,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:54,520 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:54,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:54,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:54,521 INFO L87 Difference]: Start difference. First operand 1559 states and 1866 transitions. Second operand 4 states. [2021-01-06 19:24:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:54,685 INFO L93 Difference]: Finished difference Result 2553 states and 3030 transitions. [2021-01-06 19:24:54,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:24:54,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2021-01-06 19:24:54,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:54,689 INFO L225 Difference]: With dead ends: 2553 [2021-01-06 19:24:54,690 INFO L226 Difference]: Without dead ends: 704 [2021-01-06 19:24:54,693 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 [2021-01-06 19:24:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2021-01-06 19:24:54,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 699. [2021-01-06 19:24:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2021-01-06 19:24:54,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 777 transitions. [2021-01-06 19:24:54,747 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 777 transitions. Word has length 94 [2021-01-06 19:24:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:54,748 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 777 transitions. [2021-01-06 19:24:54,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:54,748 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 777 transitions. [2021-01-06 19:24:54,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:24:54,749 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:54,749 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 19:24:54,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:24:54,750 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:54,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash -400908240, now seen corresponding path program 1 times [2021-01-06 19:24:54,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:54,751 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523086068] [2021-01-06 19:24:54,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:54,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:54,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:54,795 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523086068] [2021-01-06 19:24:54,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:54,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:54,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452505375] [2021-01-06 19:24:54,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:54,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:54,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:54,797 INFO L87 Difference]: Start difference. First operand 699 states and 777 transitions. Second operand 3 states. [2021-01-06 19:24:54,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:54,873 INFO L93 Difference]: Finished difference Result 1019 states and 1137 transitions. [2021-01-06 19:24:54,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:54,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-01-06 19:24:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:54,888 INFO L225 Difference]: With dead ends: 1019 [2021-01-06 19:24:54,888 INFO L226 Difference]: Without dead ends: 582 [2021-01-06 19:24:54,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:54,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-01-06 19:24:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2021-01-06 19:24:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2021-01-06 19:24:54,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 641 transitions. [2021-01-06 19:24:54,949 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 641 transitions. Word has length 94 [2021-01-06 19:24:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:54,950 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 641 transitions. [2021-01-06 19:24:54,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:54,950 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 641 transitions. [2021-01-06 19:24:54,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:24:54,951 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:54,952 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2021-01-06 19:24:54,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:24:54,952 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:54,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:54,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1944009862, now seen corresponding path program 1 times [2021-01-06 19:24:54,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:54,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869148533] [2021-01-06 19:24:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:24:55,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869148533] [2021-01-06 19:24:55,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:55,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:24:55,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625447359] [2021-01-06 19:24:55,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:55,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:55,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:55,067 INFO L87 Difference]: Start difference. First operand 582 states and 641 transitions. Second operand 4 states. [2021-01-06 19:24:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:55,137 INFO L93 Difference]: Finished difference Result 586 states and 645 transitions. [2021-01-06 19:24:55,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:55,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 19:24:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:55,139 INFO L225 Difference]: With dead ends: 586 [2021-01-06 19:24:55,139 INFO L226 Difference]: Without dead ends: 0 [2021-01-06 19:24:55,140 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:55,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-01-06 19:24:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-01-06 19:24:55,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-01-06 19:24:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-01-06 19:24:55,141 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2021-01-06 19:24:55,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:55,141 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-01-06 19:24:55,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-01-06 19:24:55,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-01-06 19:24:55,142 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:24:55,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-01-06 19:24:55,269 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 55 [2021-01-06 19:24:55,430 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 118 [2021-01-06 19:24:55,544 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 77 [2021-01-06 19:24:55,734 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2021-01-06 19:24:56,443 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 91 [2021-01-06 19:24:58,178 WARN L197 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-01-06 19:24:58,517 WARN L197 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 48 [2021-01-06 19:24:59,236 WARN L197 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 19:24:59,473 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2021-01-06 19:25:00,173 WARN L197 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2021-01-06 19:25:00,472 WARN L197 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2021-01-06 19:25:01,059 WARN L197 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2021-01-06 19:25:01,270 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2021-01-06 19:25:01,910 WARN L197 SmtUtils]: Spent 638.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2021-01-06 19:25:02,021 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 33 [2021-01-06 19:25:02,230 WARN L197 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2021-01-06 19:25:02,909 WARN L197 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2021-01-06 19:25:03,093 WARN L197 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 41 [2021-01-06 19:25:03,318 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2021-01-06 19:25:04,023 WARN L197 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 19:25:04,755 WARN L197 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 19:25:05,482 WARN L197 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 19:25:06,130 WARN L197 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2021-01-06 19:25:06,870 WARN L197 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 19:25:07,544 WARN L197 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2021-01-06 19:25:08,201 WARN L197 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2021-01-06 19:25:08,803 WARN L197 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2021-01-06 19:25:09,466 WARN L197 SmtUtils]: Spent 661.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2021-01-06 19:25:10,147 WARN L197 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2021-01-06 19:25:10,388 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 46 [2021-01-06 19:25:10,678 WARN L197 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 40 [2021-01-06 19:25:10,996 WARN L197 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2021-01-06 19:25:11,710 WARN L197 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 19:25:11,941 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2021-01-06 19:25:12,119 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2021-01-06 19:25:12,299 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2021-01-06 19:25:12,549 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2021-01-06 19:25:12,866 WARN L197 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2021-01-06 19:25:13,554 WARN L197 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2021-01-06 19:25:14,216 WARN L197 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 58 [2021-01-06 19:25:14,984 WARN L197 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 19:25:15,702 WARN L197 SmtUtils]: Spent 714.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 19:25:16,213 WARN L197 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-01-06 19:25:16,356 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2021-01-06 19:25:16,924 WARN L197 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 52 [2021-01-06 19:25:17,593 WARN L197 SmtUtils]: Spent 666.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2021-01-06 19:25:17,943 WARN L197 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 54 [2021-01-06 19:25:18,123 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 37 [2021-01-06 19:25:18,285 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2021-01-06 19:25:18,418 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2021-01-06 19:25:19,085 WARN L197 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 19:25:19,728 WARN L197 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 60 [2021-01-06 19:25:20,403 WARN L197 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2021-01-06 19:25:20,409 INFO L189 CegarLoopUtils]: For program point L135(lines 135 144) no Hoare annotation was computed. [2021-01-06 19:25:20,409 INFO L189 CegarLoopUtils]: For program point L135-2(lines 135 144) no Hoare annotation was computed. [2021-01-06 19:25:20,409 INFO L189 CegarLoopUtils]: For program point L36(lines 36 44) no Hoare annotation was computed. [2021-01-06 19:25:20,409 INFO L189 CegarLoopUtils]: For program point L135-3(lines 135 144) no Hoare annotation was computed. [2021-01-06 19:25:20,410 INFO L189 CegarLoopUtils]: For program point L135-5(lines 135 144) no Hoare annotation was computed. [2021-01-06 19:25:20,410 INFO L189 CegarLoopUtils]: For program point L135-6(lines 135 144) no Hoare annotation was computed. [2021-01-06 19:25:20,410 INFO L189 CegarLoopUtils]: For program point L135-8(lines 135 144) no Hoare annotation was computed. [2021-01-06 19:25:20,410 INFO L189 CegarLoopUtils]: For program point L135-9(lines 135 144) no Hoare annotation was computed. [2021-01-06 19:25:20,410 INFO L189 CegarLoopUtils]: For program point L135-11(lines 135 144) no Hoare annotation was computed. [2021-01-06 19:25:20,410 INFO L189 CegarLoopUtils]: For program point L135-12(lines 135 144) no Hoare annotation was computed. [2021-01-06 19:25:20,410 INFO L189 CegarLoopUtils]: For program point L135-14(lines 135 144) no Hoare annotation was computed. [2021-01-06 19:25:20,410 INFO L189 CegarLoopUtils]: For program point L136(lines 136 141) no Hoare annotation was computed. [2021-01-06 19:25:20,411 INFO L189 CegarLoopUtils]: For program point L136-1(lines 136 141) no Hoare annotation was computed. [2021-01-06 19:25:20,411 INFO L189 CegarLoopUtils]: For program point L136-2(lines 136 141) no Hoare annotation was computed. [2021-01-06 19:25:20,411 INFO L189 CegarLoopUtils]: For program point L136-3(lines 136 141) no Hoare annotation was computed. [2021-01-06 19:25:20,411 INFO L189 CegarLoopUtils]: For program point L136-4(lines 136 141) no Hoare annotation was computed. [2021-01-06 19:25:20,412 INFO L185 CegarLoopUtils]: At program point L401(lines 390 403) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,412 INFO L189 CegarLoopUtils]: For program point L203(line 203) no Hoare annotation was computed. [2021-01-06 19:25:20,412 INFO L185 CegarLoopUtils]: At program point L402(lines 386 404) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,412 INFO L189 CegarLoopUtils]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-01-06 19:25:20,413 INFO L185 CegarLoopUtils]: At program point L40(lines 35 74) the Hoare annotation is: (and (<= (+ ~local~0 1) ~token~0) (not (= ~E_1~0 0)) (= ~t1_pc~0 1) (not (= ~E_1~0 1)) (not (= ~T1_E~0 1)) (= ~t1_i~0 1) (< ~token~0 (+ ~local~0 2)) (not (= ~t1_st~0 0)) (not (= ~T1_E~0 0)) (<= 2 ~E_M~0) (not (= ~m_st~0 0))) [2021-01-06 19:25:20,413 INFO L189 CegarLoopUtils]: For program point L207(lines 207 211) no Hoare annotation was computed. [2021-01-06 19:25:20,413 INFO L189 CegarLoopUtils]: For program point L207-1(lines 202 240) no Hoare annotation was computed. [2021-01-06 19:25:20,413 INFO L189 CegarLoopUtils]: For program point L439(lines 439 448) no Hoare annotation was computed. [2021-01-06 19:25:20,413 INFO L185 CegarLoopUtils]: At program point L439-1(lines 439 448) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,414 INFO L185 CegarLoopUtils]: At program point L241(lines 196 246) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2021-01-06 19:25:20,415 INFO L185 CegarLoopUtils]: At program point L473(lines 464 475) the Hoare annotation is: (= ~t1_i~0 1) [2021-01-06 19:25:20,415 INFO L189 CegarLoopUtils]: For program point L12(line 12) no Hoare annotation was computed. [2021-01-06 19:25:20,415 INFO L189 CegarLoopUtils]: For program point L311(lines 311 315) no Hoare annotation was computed. [2021-01-06 19:25:20,415 INFO L189 CegarLoopUtils]: For program point L311-2(lines 311 315) no Hoare annotation was computed. [2021-01-06 19:25:20,415 INFO L189 CegarLoopUtils]: For program point L311-3(lines 311 315) no Hoare annotation was computed. [2021-01-06 19:25:20,416 INFO L185 CegarLoopUtils]: At program point L212(lines 202 240) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2021-01-06 19:25:20,416 INFO L185 CegarLoopUtils]: At program point L146(lines 134 148) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 ~M_E~0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse2 (= ~T1_E~0 ~M_E~0)) (.cse3 (= ~M_E~0 2)) (.cse4 (= ~m_pc~0 0)) (.cse5 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse6 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~m_pc~0 ~t1_pc~0)) (.cse10 (= ~t1_i~0 1)) (.cse11 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~m_st~0 0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 (<= ~token~0 ~local~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~local~0 ~token~0) .cse11))) [2021-01-06 19:25:20,416 INFO L189 CegarLoopUtils]: For program point L311-5(lines 311 315) no Hoare annotation was computed. [2021-01-06 19:25:20,416 INFO L185 CegarLoopUtils]: At program point L146-1(lines 134 148) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse1 (not (= ~E_1~0 0))) (.cse3 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse11 (not (= ~t1_st~0 0))) (.cse8 (not (= ~T1_E~0 0))) (.cse10 (not (= ~m_st~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (= ~t1_i~0 1)) (.cse9 (<= 2 ~E_M~0))) (or (and (not .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 (not (= ~E_1~0 1)) .cse5 .cse6 .cse7 .cse11 .cse8 .cse9 .cse10) (and .cse1 .cse3 (<= ~token~0 ~local~0) .cse11 .cse8 .cse10 .cse0 .cse2 .cse5 .cse6 .cse7 (<= ~local~0 ~token~0) .cse9))) [2021-01-06 19:25:20,416 INFO L189 CegarLoopUtils]: For program point L311-6(lines 311 315) no Hoare annotation was computed. [2021-01-06 19:25:20,416 INFO L189 CegarLoopUtils]: For program point L80(lines 80 88) no Hoare annotation was computed. [2021-01-06 19:25:20,417 INFO L185 CegarLoopUtils]: At program point L146-2(lines 134 148) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0))) (let ((.cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse3 (not (= ~E_1~0 1))) (.cse6 (not (= ~t1_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= ~t1_i~0 1)) (.cse7 (not (= ~T1_E~0 0))) (.cse8 (not .cse9))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and (<= (+ ~local~0 1) ~token~0) .cse0 (= ~t1_pc~0 1) .cse1 .cse3 .cse4 .cse5 (< ~token~0 (+ ~local~0 2)) .cse6 .cse9 .cse7) (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse4 .cse5 .cse7 .cse8 (= ~m_pc~0 0))))) [2021-01-06 19:25:20,417 INFO L189 CegarLoopUtils]: For program point L311-8(lines 311 315) no Hoare annotation was computed. [2021-01-06 19:25:20,417 INFO L185 CegarLoopUtils]: At program point L146-3(lines 134 148) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1))) (let ((.cse4 (not (= ~t1_st~0 0))) (.cse15 (not .cse16)) (.cse2 (not (= ~E_1~0 1))) (.cse3 (<= ~token~0 ~local~0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse12 (<= ~local~0 ~token~0)) (.cse0 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse1 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (not (= ~T1_E~0 1))) (.cse11 (= ~t1_i~0 1)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse6 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse7 .cse8 .cse1 .cse2 .cse9 .cse10 .cse11 .cse4 .cse14 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 (<= (+ ~local~0 1) ~token~0) .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse15 .cse0 .cse7 .cse8 .cse1 .cse9 .cse10 .cse11 .cse4 .cse14 .cse5 .cse13) (and .cse0 .cse15 .cse7 .cse1 .cse8 .cse9 .cse10 .cse11 .cse4 .cse5 .cse6 .cse13) (and .cse0 .cse15 .cse7 .cse1 .cse8 .cse2 .cse9 .cse10 .cse11 .cse14 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse7 .cse1 .cse9 .cse10 .cse11 .cse14 .cse5 .cse13 .cse6)))) [2021-01-06 19:25:20,417 INFO L189 CegarLoopUtils]: For program point L311-9(lines 311 315) no Hoare annotation was computed. [2021-01-06 19:25:20,417 INFO L185 CegarLoopUtils]: At program point L146-4(lines 134 148) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1))) (let ((.cse8 (not (= ~t1_st~0 0))) (.cse15 (not .cse16)) (.cse4 (not (= ~E_1~0 1))) (.cse12 (<= ~token~0 ~local~0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse14 (<= ~local~0 ~token~0)) (.cse0 (not (= ~E_1~0 0))) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse5 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse6 (not (= ~T1_E~0 1))) (.cse7 (= ~t1_i~0 1)) (.cse9 (not (= ~m_st~0 0))) (.cse10 (not (= ~T1_E~0 0))) (.cse11 (<= 2 ~E_M~0)) (.cse13 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse12 .cse8 .cse10 .cse13 .cse1 .cse2 .cse5 .cse6 .cse7 .cse14 .cse11) (and .cse0 .cse3 .cse4 .cse12 .cse10 .cse13 .cse15 .cse1 .cse2 .cse5 .cse6 .cse7 .cse14 .cse11) (and .cse0 .cse3 .cse4 .cse8 .cse10 (<= (+ ~local~0 1) ~token~0) .cse16 .cse1 .cse2 .cse5 .cse6 .cse7 (< ~token~0 (+ ~local~0 2)) .cse11) (and .cse15 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse15 .cse1 .cse3 .cse2 .cse5 .cse6 .cse7 .cse8 .cse10 .cse13 .cse11) (and .cse0 .cse15 .cse1 .cse3 .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11) (and .cse0 .cse3 .cse4 .cse12 .cse9 .cse10 .cse1 .cse2 .cse5 .cse6 .cse7 .cse14 .cse11) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13)))) [2021-01-06 19:25:20,418 INFO L189 CegarLoopUtils]: For program point L311-11(lines 311 315) no Hoare annotation was computed. [2021-01-06 19:25:20,418 INFO L189 CegarLoopUtils]: For program point L311-12(lines 311 315) no Hoare annotation was computed. [2021-01-06 19:25:20,418 INFO L189 CegarLoopUtils]: For program point L311-14(lines 311 315) no Hoare annotation was computed. [2021-01-06 19:25:20,418 INFO L185 CegarLoopUtils]: At program point L345(lines 339 347) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,418 INFO L189 CegarLoopUtils]: For program point L279-1(lines 278 301) no Hoare annotation was computed. [2021-01-06 19:25:20,418 INFO L189 CegarLoopUtils]: For program point L180(lines 180 190) no Hoare annotation was computed. [2021-01-06 19:25:20,418 INFO L189 CegarLoopUtils]: For program point L279-3(lines 278 301) no Hoare annotation was computed. [2021-01-06 19:25:20,419 INFO L185 CegarLoopUtils]: At program point L147(lines 131 149) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (= ~t1_i~0 1)) (.cse12 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~local~0 ~token~0) .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_st~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2021-01-06 19:25:20,419 INFO L189 CegarLoopUtils]: For program point L180-1(lines 180 190) no Hoare annotation was computed. [2021-01-06 19:25:20,419 INFO L185 CegarLoopUtils]: At program point L147-1(lines 131 149) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse4 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse2 (not (= ~E_1~0 0))) (.cse5 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse12 (not (= ~t1_st~0 0))) (.cse9 (not (= ~T1_E~0 0))) (.cse11 (not (= ~m_st~0 0))) (.cse1 (= ~t1_pc~0 1)) (.cse3 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse7 (not (= ~T1_E~0 1))) (.cse8 (= ~t1_i~0 1)) (.cse10 (<= 2 ~E_M~0))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse5 (not (= ~E_1~0 1)) .cse12 .cse11 .cse9 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10) (and .cse2 .cse5 (<= ~token~0 ~local~0) .cse12 .cse9 .cse11 .cse1 .cse3 .cse6 .cse7 .cse8 (<= ~local~0 ~token~0) .cse10))) [2021-01-06 19:25:20,419 INFO L189 CegarLoopUtils]: For program point L180-2(lines 180 190) no Hoare annotation was computed. [2021-01-06 19:25:20,419 INFO L185 CegarLoopUtils]: At program point L147-2(lines 131 149) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0))) (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse4 (not (= ~E_1~0 1))) (.cse7 (not (= ~t1_st~0 0))) (.cse1 (not (= ~E_1~0 0))) (.cse3 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (= ~t1_i~0 1)) (.cse8 (not (= ~T1_E~0 0))) (.cse9 (not .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 (<= (+ ~local~0 1) ~token~0) (= ~t1_pc~0 1) .cse2 .cse4 .cse5 .cse6 (< ~token~0 (+ ~local~0 2)) .cse7 .cse10 .cse8) (and .cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse5 .cse6 .cse8 .cse9 (= ~m_pc~0 0))))) [2021-01-06 19:25:20,419 INFO L189 CegarLoopUtils]: For program point L48(line 48) no Hoare annotation was computed. [2021-01-06 19:25:20,420 INFO L185 CegarLoopUtils]: At program point L147-3(lines 131 149) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse7 (not .cse17)) (.cse16 (not (= ~t1_st~0 0))) (.cse6 (= ~m_pc~0 0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse15 (not (= ~m_st~0 0))) (.cse5 (not (= ~T1_E~0 0))) (.cse8 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 (<= (+ ~local~0 1) ~token~0) .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse15 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse16 .cse15 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse8 .cse2 .cse10 .cse11 .cse12 .cse15 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-01-06 19:25:20,420 INFO L185 CegarLoopUtils]: At program point L147-4(lines 131 149) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse7 (not .cse17)) (.cse15 (not (= ~t1_st~0 0))) (.cse6 (= ~m_pc~0 0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (<= ~token~0 ~local~0)) (.cse16 (not (= ~m_st~0 0))) (.cse5 (not (= ~T1_E~0 0))) (.cse8 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse9 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse13 (<= ~local~0 ~token~0)) (.cse14 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse5 (<= (+ ~local~0 1) ~token~0) .cse17 .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse15 .cse16 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse8 .cse2 .cse10 .cse11 .cse12 .cse16 .cse5 .cse14 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse16 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2021-01-06 19:25:20,420 INFO L189 CegarLoopUtils]: For program point L215(lines 215 222) no Hoare annotation was computed. [2021-01-06 19:25:20,420 INFO L189 CegarLoopUtils]: For program point L116(lines 116 125) no Hoare annotation was computed. [2021-01-06 19:25:20,420 INFO L189 CegarLoopUtils]: For program point L83(lines 83 87) no Hoare annotation was computed. [2021-01-06 19:25:20,420 INFO L189 CegarLoopUtils]: For program point L116-2(lines 116 125) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L116-3(lines 116 125) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L116-5(lines 116 125) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L116-6(lines 116 125) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L116-8(lines 116 125) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L116-9(lines 116 125) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L116-11(lines 116 125) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L116-12(lines 116 125) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L116-14(lines 116 125) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L117(lines 117 122) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L117-1(lines 117 122) no Hoare annotation was computed. [2021-01-06 19:25:20,421 INFO L185 CegarLoopUtils]: At program point L84(lines 79 110) the Hoare annotation is: (let ((.cse0 (not (= ~E_1~0 0))) (.cse1 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse5 (<= 2 ~E_M~0)) (.cse6 (not (= ~m_st~0 0)))) (or (and .cse0 (= ~t1_pc~0 1) .cse1 (not (= ~E_1~0 1)) .cse2 .cse3 (<= ~token~0 ~local~0) (not (= ~t1_st~0 0)) (<= ~local~0 ~token~0) .cse4 .cse5 .cse6) (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~m_pc~0 0)))) [2021-01-06 19:25:20,421 INFO L189 CegarLoopUtils]: For program point L117-2(lines 117 122) no Hoare annotation was computed. [2021-01-06 19:25:20,422 INFO L189 CegarLoopUtils]: For program point L117-3(lines 117 122) no Hoare annotation was computed. [2021-01-06 19:25:20,422 INFO L189 CegarLoopUtils]: For program point L117-4(lines 117 122) no Hoare annotation was computed. [2021-01-06 19:25:20,422 INFO L189 CegarLoopUtils]: For program point L184(lines 184 189) no Hoare annotation was computed. [2021-01-06 19:25:20,422 INFO L189 CegarLoopUtils]: For program point L184-1(lines 184 189) no Hoare annotation was computed. [2021-01-06 19:25:20,422 INFO L189 CegarLoopUtils]: For program point L184-2(lines 184 189) no Hoare annotation was computed. [2021-01-06 19:25:20,422 INFO L185 CegarLoopUtils]: At program point L383(lines 376 385) the Hoare annotation is: (and (= ~E_1~0 ~M_E~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~t1_i~0 1) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= ~m_pc~0 0) (<= 2 ~E_M~0)) [2021-01-06 19:25:20,422 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-01-06 19:25:20,422 INFO L189 CegarLoopUtils]: For program point L284-1(lines 278 301) no Hoare annotation was computed. [2021-01-06 19:25:20,422 INFO L189 CegarLoopUtils]: For program point L251-1(lines 250 273) no Hoare annotation was computed. [2021-01-06 19:25:20,422 INFO L189 CegarLoopUtils]: For program point L251-2(lines 251 255) no Hoare annotation was computed. [2021-01-06 19:25:20,422 INFO L189 CegarLoopUtils]: For program point L284-3(lines 278 301) no Hoare annotation was computed. [2021-01-06 19:25:20,423 INFO L189 CegarLoopUtils]: For program point L251-4(lines 250 273) no Hoare annotation was computed. [2021-01-06 19:25:20,423 INFO L189 CegarLoopUtils]: For program point L319(lines 319 323) no Hoare annotation was computed. [2021-01-06 19:25:20,423 INFO L189 CegarLoopUtils]: For program point L352-1(lines 351 374) no Hoare annotation was computed. [2021-01-06 19:25:20,423 INFO L185 CegarLoopUtils]: At program point L319-2(lines 279 283) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse1 (= ~E_1~0 ~M_E~0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~m_pc~0 0)) (.cse6 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse7 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse9 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse10 (= ~t1_st~0 0)) (.cse11 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (= ~t1_i~0 1)) (.cse13 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~local~0 ~token~0) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~m_st~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2021-01-06 19:25:20,423 INFO L189 CegarLoopUtils]: For program point L319-3(lines 319 323) no Hoare annotation was computed. [2021-01-06 19:25:20,423 INFO L185 CegarLoopUtils]: At program point L319-5(lines 1 475) the Hoare annotation is: (let ((.cse0 (not (= ~E_1~0 0))) (.cse3 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse7 (not (= ~T1_E~0 0))) (.cse8 (not (= ~m_st~0 0))) (.cse1 (= ~t1_pc~0 1)) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (= ~t1_i~0 1)) (.cse9 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~t1_st~0 0)) .cse7 .cse9 .cse8) (and (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) .cse0 .cse3 .cse7 .cse8 (not .cse1) .cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) (= ULTIMATE.start_activate_threads_~tmp___0~0 0) .cse4 .cse5 .cse6 .cse9))) [2021-01-06 19:25:20,424 INFO L189 CegarLoopUtils]: For program point L319-6(lines 319 323) no Hoare annotation was computed. [2021-01-06 19:25:20,424 INFO L185 CegarLoopUtils]: At program point L319-8(lines 1 475) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0))) (let ((.cse0 (not (= ~E_1~0 0))) (.cse6 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse1 (not (= ~E_1~0 1))) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (= ~t1_i~0 1)) (.cse5 (not (= ~T1_E~0 0))) (.cse7 (not .cse4))) (or (and (<= (+ ~local~0 1) ~token~0) .cse0 (= ~t1_pc~0 1) .cse1 .cse2 .cse3 (< ~token~0 (+ ~local~0 2)) .cse4 .cse5) (and .cse0 (= |ULTIMATE.start_is_master_triggered_#res| 0) .cse6 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0) .cse2 .cse3 .cse5 (= ~m_pc~0 0) .cse7) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse5 .cse7)))) [2021-01-06 19:25:20,424 INFO L189 CegarLoopUtils]: For program point L319-9(lines 319 323) no Hoare annotation was computed. [2021-01-06 19:25:20,424 INFO L185 CegarLoopUtils]: At program point L319-11(lines 279 283) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,424 INFO L189 CegarLoopUtils]: For program point L319-12(lines 319 323) no Hoare annotation was computed. [2021-01-06 19:25:20,425 INFO L185 CegarLoopUtils]: At program point L319-14(lines 352 356) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,425 INFO L189 CegarLoopUtils]: For program point L452(lines 452 456) no Hoare annotation was computed. [2021-01-06 19:25:20,425 INFO L185 CegarLoopUtils]: At program point L155(lines 162 166) the Hoare annotation is: (and (= ~E_1~0 ~M_E~0) (= ~t1_st~0 0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 ~M_E~0) (<= ~token~0 ~local~0) (= ~M_E~0 2) (= ~t1_i~0 1) (= ~m_st~0 0) (<= ~local~0 ~token~0) (= ~m_pc~0 0) (<= 2 ~E_M~0)) [2021-01-06 19:25:20,425 INFO L185 CegarLoopUtils]: At program point L155-1(lines 150 157) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2021-01-06 19:25:20,426 INFO L185 CegarLoopUtils]: At program point L420-1(lines 275 457) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,426 INFO L189 CegarLoopUtils]: For program point L421(line 421) no Hoare annotation was computed. [2021-01-06 19:25:20,426 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-01-06 19:25:20,426 INFO L189 CegarLoopUtils]: For program point L289-1(lines 278 301) no Hoare annotation was computed. [2021-01-06 19:25:20,426 INFO L189 CegarLoopUtils]: For program point L256-1(lines 250 273) no Hoare annotation was computed. [2021-01-06 19:25:20,426 INFO L189 CegarLoopUtils]: For program point L289-3(lines 278 301) no Hoare annotation was computed. [2021-01-06 19:25:20,427 INFO L189 CegarLoopUtils]: For program point L256-3(lines 250 273) no Hoare annotation was computed. [2021-01-06 19:25:20,427 INFO L185 CegarLoopUtils]: At program point L91-1(lines 79 110) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0))) (let ((.cse3 (not (= ~E_1~0 1))) (.cse0 (not (= ~E_1~0 0))) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~T1_E~0 1))) (.cse6 (= ~t1_i~0 1)) (.cse7 (not (= ~T1_E~0 0))) (.cse8 (<= 2 ~E_M~0)) (.cse9 (= ~m_pc~0 0)) (.cse11 (not .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 (<= ~local~0 ~token~0) .cse7 .cse8 .cse9) (and (<= (+ ~local~0 1) ~token~0) .cse0 (= ~t1_pc~0 1) .cse3 .cse5 .cse6 (< ~token~0 (+ ~local~0 2)) .cse10 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11)))) [2021-01-06 19:25:20,427 INFO L189 CegarLoopUtils]: For program point L92(line 92) no Hoare annotation was computed. [2021-01-06 19:25:20,427 INFO L189 CegarLoopUtils]: For program point L357-1(lines 351 374) no Hoare annotation was computed. [2021-01-06 19:25:20,427 INFO L185 CegarLoopUtils]: At program point L192(lines 179 194) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2021-01-06 19:25:20,428 INFO L185 CegarLoopUtils]: At program point L192-1(lines 179 194) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,428 INFO L185 CegarLoopUtils]: At program point L192-2(lines 179 194) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,429 INFO L185 CegarLoopUtils]: At program point L226(lines 202 240) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2021-01-06 19:25:20,429 INFO L185 CegarLoopUtils]: At program point L193(lines 176 195) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2021-01-06 19:25:20,429 INFO L185 CegarLoopUtils]: At program point L193-1(lines 176 195) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,430 INFO L185 CegarLoopUtils]: At program point L127(lines 115 129) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 ~M_E~0)) (.cse1 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (= ~t1_st~0 0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~T1_E~0 ~M_E~0)) (.cse5 (= ~M_E~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~m_pc~0 0)) (.cse8 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_st~0 0)) .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 .cse6 (<= ~local~0 ~token~0) .cse7 .cse8))) [2021-01-06 19:25:20,430 INFO L185 CegarLoopUtils]: At program point L193-2(lines 176 195) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,430 INFO L185 CegarLoopUtils]: At program point L127-1(lines 115 129) the Hoare annotation is: (let ((.cse1 (not (= ~E_1~0 0))) (.cse0 (= ~t1_pc~0 1)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (not (= ~T1_E~0 1))) (.cse4 (= ~t1_i~0 1)) (.cse5 (not (= ~T1_E~0 0))) (.cse6 (<= 2 ~E_M~0)) (.cse7 (not (= ~m_st~0 0)))) (or (and (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) (not .cse0) .cse1 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse0 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 (not (= ~t1_st~0 0)) (<= ~local~0 ~token~0) .cse5 .cse6 .cse7))) [2021-01-06 19:25:20,430 INFO L185 CegarLoopUtils]: At program point L61(lines 35 74) the Hoare annotation is: (let ((.cse16 (= ~t1_pc~0 1))) (let ((.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse6 (not .cse16)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse15 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse14 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse5 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse4 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse5 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse16 .cse14 .cse11 .cse12 (<= ~token~0 ~local~0) .cse3 (<= ~local~0 ~token~0) .cse5 .cse13 .cse15 .cse4) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse16 .cse14 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse5 .cse13 .cse4)))) [2021-01-06 19:25:20,431 INFO L185 CegarLoopUtils]: At program point L127-2(lines 115 129) the Hoare annotation is: (let ((.cse1 (not (= ~E_1~0 1))) (.cse4 (not (= ~t1_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse7 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (= ~t1_i~0 1)) (.cse5 (not (= ~T1_E~0 0))) (.cse6 (not (= ~m_st~0 0)))) (or (and .cse0 (<= (+ ~local~0 1) ~token~0) (= ~t1_pc~0 1) .cse1 .cse2 .cse3 (< ~token~0 (+ ~local~0 2)) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse6 (= ~m_pc~0 0)))) [2021-01-06 19:25:20,431 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-01-06 19:25:20,431 INFO L185 CegarLoopUtils]: At program point L127-3(lines 115 129) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse11 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse12 (not .cse1)) (.cse13 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (not (= ~m_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse2 (not (= ~E_1~0 1))) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= ~token~0 ~local~0)) (.cse14 (not (= ~t1_st~0 0))) (.cse7 (<= ~local~0 ~token~0)) (.cse8 (not (= ~T1_E~0 0))) (.cse9 (<= 2 ~E_M~0)) (.cse15 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse0 .cse13 .cse3 .cse4 .cse5 .cse14 .cse8 .cse9 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse0 .cse13 .cse2 .cse3 .cse4 .cse5 .cse10 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse15) (and .cse11 .cse0 .cse2 .cse6 .cse8 .cse15 .cse12 .cse13 .cse3 .cse4 .cse5 .cse7 .cse9) (and (<= (+ ~local~0 1) ~token~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~token~0 (+ ~local~0 2)) .cse14 .cse8 .cse9) (and .cse11 .cse12 .cse0 .cse13 .cse3 .cse4 .cse5 .cse14 .cse10 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 .cse15)))) [2021-01-06 19:25:20,431 INFO L185 CegarLoopUtils]: At program point L127-4(lines 115 129) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse13 (not .cse1)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse10 (not (= ~m_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse2 (not (= ~E_1~0 1))) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= ~t1_i~0 1)) (.cse6 (<= ~token~0 ~local~0)) (.cse11 (not (= ~t1_st~0 0))) (.cse7 (<= ~local~0 ~token~0)) (.cse8 (not (= ~T1_E~0 0))) (.cse9 (<= 2 ~E_M~0)) (.cse15 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9 .cse10) (and .cse12 .cse13 .cse0 .cse14 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9 .cse15) (and .cse12 .cse13 .cse0 .cse14 .cse2 .cse3 .cse4 .cse5 .cse10 .cse8 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse15) (and .cse12 .cse0 .cse2 .cse6 .cse8 .cse15 .cse13 .cse14 .cse3 .cse4 .cse5 .cse7 .cse9) (and (<= (+ ~local~0 1) ~token~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~token~0 (+ ~local~0 2)) .cse11 .cse8 .cse9) (and .cse12 .cse13 .cse0 .cse14 .cse3 .cse4 .cse5 .cse11 .cse10 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9 .cse15)))) [2021-01-06 19:25:20,432 INFO L185 CegarLoopUtils]: At program point L458(lines 405 463) the Hoare annotation is: (= ~t1_i~0 1) [2021-01-06 19:25:20,432 INFO L185 CegarLoopUtils]: At program point L128(lines 112 130) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 ~M_E~0)) (.cse1 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse3 (= ~t1_st~0 0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~T1_E~0 ~M_E~0)) (.cse6 (= ~M_E~0 2)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~m_pc~0 0)) (.cse9 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_st~0 0)) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 ~local~0) .cse6 .cse7 (<= ~local~0 ~token~0) .cse8 .cse9))) [2021-01-06 19:25:20,432 INFO L185 CegarLoopUtils]: At program point L128-1(lines 112 130) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1)) (.cse0 (not (= ~E_1~0 0))) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse4 (not (= ~T1_E~0 1))) (.cse5 (= ~t1_i~0 1)) (.cse6 (not (= ~T1_E~0 0))) (.cse7 (<= 2 ~E_M~0)) (.cse8 (not (= ~m_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~token~0 ~local~0) .cse5 (not (= ~t1_st~0 0)) (<= ~local~0 ~token~0) .cse6 .cse7 .cse8) (and (= |ULTIMATE.start_is_transmit1_triggered_#res| 0) (not .cse1) .cse0 .cse2 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) [2021-01-06 19:25:20,432 INFO L185 CegarLoopUtils]: At program point L128-2(lines 112 130) the Hoare annotation is: (let ((.cse0 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse1 (not (= ~E_1~0 1))) (.cse8 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse2 (not (= ~T1_E~0 1))) (.cse3 (= ~t1_i~0 1)) (.cse4 (not (= ~t1_st~0 0))) (.cse5 (not (= ~T1_E~0 0))) (.cse6 (not (= ~m_st~0 0)))) (or (and .cse0 (<= (+ ~local~0 1) ~token~0) (= ~t1_pc~0 1) .cse1 .cse2 .cse3 (< ~token~0 (+ ~local~0 2)) .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse3 .cse5 .cse6 (= ~m_pc~0 0)) (and .cse0 .cse7 .cse1 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6))) [2021-01-06 19:25:20,433 INFO L185 CegarLoopUtils]: At program point L128-3(lines 112 130) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse13 (not .cse1)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (<= ~token~0 ~local~0)) (.cse16 (= ~m_pc~0 0)) (.cse8 (<= ~local~0 ~token~0)) (.cse10 (not (= ~m_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~T1_E~0 1))) (.cse7 (= ~t1_i~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse9 (not (= ~T1_E~0 0))) (.cse11 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse9 .cse16 .cse11) (and .cse12 .cse13 .cse0 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse10 .cse9 .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse10 .cse9 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse7 .cse9 .cse11 .cse10 .cse16) (and .cse12 .cse0 .cse3 .cse6 .cse9 .cse16 .cse13 .cse2 .cse14 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse3 .cse6 .cse15 .cse9 .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse9 .cse11 .cse10) (and (<= (+ ~local~0 1) ~token~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (< ~token~0 (+ ~local~0 2)) .cse15 .cse9 .cse11)))) [2021-01-06 19:25:20,433 INFO L185 CegarLoopUtils]: At program point L128-4(lines 112 130) the Hoare annotation is: (let ((.cse1 (= ~t1_pc~0 1))) (let ((.cse12 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse13 (not .cse1)) (.cse14 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse6 (<= ~token~0 ~local~0)) (.cse16 (= ~m_pc~0 0)) (.cse8 (<= ~local~0 ~token~0)) (.cse10 (not (= ~m_st~0 0))) (.cse0 (not (= ~E_1~0 0))) (.cse2 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse3 (not (= ~E_1~0 1))) (.cse4 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (not (= ~T1_E~0 1))) (.cse7 (= ~t1_i~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse9 (not (= ~T1_E~0 0))) (.cse11 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse9 .cse16 .cse11) (and .cse12 .cse13 .cse0 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse10 .cse9 .cse11) (and .cse12 .cse0 .cse13 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse10 .cse9 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse7 .cse9 .cse11 .cse10 .cse16) (and .cse12 .cse0 .cse3 .cse6 .cse9 .cse16 .cse13 .cse2 .cse14 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse3 .cse6 .cse15 .cse9 .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse15 .cse9 .cse11 .cse10) (and (<= (+ ~local~0 1) ~token~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 (< ~token~0 (+ ~local~0 2)) .cse15 .cse9 .cse11)))) [2021-01-06 19:25:20,433 INFO L189 CegarLoopUtils]: For program point L261-1(lines 250 273) no Hoare annotation was computed. [2021-01-06 19:25:20,433 INFO L185 CegarLoopUtils]: At program point L294-3(lines 275 302) the Hoare annotation is: (let ((.cse17 (= ~t1_pc~0 1))) (let ((.cse3 (not (= ~t1_st~0 0))) (.cse16 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse15 (not (= ~E_1~0 1))) (.cse6 (not .cse17)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse14 (not (= ~m_st~0 0))) (.cse5 (= ~m_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse7 .cse2 .cse15 .cse10 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14) (and .cse1 .cse2 .cse15 .cse3 .cse4 (<= (+ ~local~0 1) ~token~0) .cse17 .cse7 .cse10 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse4 .cse14 .cse17 .cse7 .cse10 .cse11 .cse12 .cse18 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse14 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse14 .cse5)))) [2021-01-06 19:25:20,433 INFO L189 CegarLoopUtils]: For program point L261-3(lines 250 273) no Hoare annotation was computed. [2021-01-06 19:25:20,434 INFO L189 CegarLoopUtils]: For program point L162-1(lines 161 174) no Hoare annotation was computed. [2021-01-06 19:25:20,434 INFO L189 CegarLoopUtils]: For program point L394(lines 394 399) no Hoare annotation was computed. [2021-01-06 19:25:20,434 INFO L189 CegarLoopUtils]: For program point L229(lines 229 236) no Hoare annotation was computed. [2021-01-06 19:25:20,434 INFO L189 CegarLoopUtils]: For program point L362-1(lines 351 374) no Hoare annotation was computed. [2021-01-06 19:25:20,434 INFO L189 CegarLoopUtils]: For program point L-1(line -1) no Hoare annotation was computed. [2021-01-06 19:25:20,434 INFO L189 CegarLoopUtils]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-01-06 19:25:20,435 INFO L185 CegarLoopUtils]: At program point L266-1(lines 247 274) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 ~M_E~0)) (.cse1 (= ~t1_st~0 0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0) .cse6 .cse7))) [2021-01-06 19:25:20,435 INFO L185 CegarLoopUtils]: At program point L266-3(lines 247 274) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 0)) (.cse14 (= ~t1_pc~0 1))) (let ((.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse0 (= |ULTIMATE.start_is_transmit1_triggered_#res| 0)) (.cse6 (not .cse14)) (.cse8 (= ULTIMATE.start_is_transmit1_triggered_~__retres1~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp___0~0 0)) (.cse7 (= |ULTIMATE.start_is_master_triggered_#res| 0)) (.cse10 (= ULTIMATE.start_is_master_triggered_~__retres1~0 0)) (.cse5 (= ~m_pc~0 0)) (.cse1 (not (= ~E_1~0 0))) (.cse2 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse15 (not (= ~E_1~0 1))) (.cse11 (not (= ~T1_E~0 1))) (.cse12 (= ~t1_i~0 1)) (.cse3 (not (= ~t1_st~0 0))) (.cse4 (not (= ~T1_E~0 0))) (.cse13 (<= 2 ~E_M~0)) (.cse18 (not .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse14 .cse2 .cse15 .cse11 .cse12 .cse16 .cse17 .cse4 .cse13 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (<= (+ ~local~0 1) ~token~0) .cse1 .cse14 .cse15 .cse11 .cse12 (< ~token~0 (+ ~local~0 2)) .cse3 .cse19 .cse4 .cse13) (and .cse1 .cse2 .cse15 .cse16 .cse3 .cse4 .cse5 .cse14 .cse7 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse16 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse17 .cse13) (and .cse0 .cse1 .cse2 .cse15 .cse18 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse7 .cse2 .cse10 .cse11 .cse12 .cse4 .cse13 .cse18 .cse5) (and .cse1 .cse2 .cse15 .cse11 .cse12 .cse3 .cse4 .cse13 .cse18)))) [2021-01-06 19:25:20,435 INFO L185 CegarLoopUtils]: At program point L167-1(lines 251 255) the Hoare annotation is: (let ((.cse0 (= ~E_1~0 ~M_E~0)) (.cse1 (= ~t1_st~0 0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~T1_E~0 ~M_E~0)) (.cse4 (= ~M_E~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~m_pc~0 0)) (.cse7 (<= 2 ~E_M~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_st~0 0)) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= ~token~0 ~local~0) .cse4 .cse5 (<= ~local~0 ~token~0) .cse6 .cse7))) [2021-01-06 19:25:20,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:25:20 BoogieIcfgContainer [2021-01-06 19:25:20,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:25:20,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:25:20,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:25:20,602 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:25:20,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:24:49" (3/4) ... [2021-01-06 19:25:20,607 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-01-06 19:25:20,637 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-01-06 19:25:20,639 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-01-06 19:25:20,639 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 19:25:20,640 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-01-06 19:25:20,677 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((E_1 == M_E && \result == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && M_E == 2) && t1_i == 1) && !(m_st == 0)) && m_pc == 0) && 2 <= E_M) || (((((((((((E_1 == M_E && \result == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && local <= token) && m_pc == 0) && 2 <= E_M) [2021-01-06 19:25:20,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((E_1 == M_E && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) || (((((((((((((E_1 == M_E && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) [2021-01-06 19:25:20,678 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) || (((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) [2021-01-06 19:25:20,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) [2021-01-06 19:25:20,679 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2021-01-06 19:25:20,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2021-01-06 19:25:20,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2021-01-06 19:25:20,680 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2021-01-06 19:25:20,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2021-01-06 19:25:20,681 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2021-01-06 19:25:20,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2021-01-06 19:25:20,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || ((((((((!(E_1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) [2021-01-06 19:25:20,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) [2021-01-06 19:25:20,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 0)) && m_pc == 0) && !(m_st == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) && !(m_st == 0))) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2021-01-06 19:25:20,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) || (((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) && !(m_st == 0)) [2021-01-06 19:25:20,685 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,685 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || (((((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) [2021-01-06 19:25:20,685 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) [2021-01-06 19:25:20,686 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,686 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(E_1 == 0) && local + 1 <= token) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || (((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) [2021-01-06 19:25:20,686 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((!(E_1 == 0) && t1_pc == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2021-01-06 19:25:20,687 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,687 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) [2021-01-06 19:25:20,691 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,691 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,691 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(E_1 == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && __retres1 == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0))) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,694 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\result == 0 && !(E_1 == 0)) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || (((((((((((\result == 0 && !(E_1 == 0)) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0))) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,694 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || (((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) [2021-01-06 19:25:20,694 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,694 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) [2021-01-06 19:25:20,695 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,695 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && m_st == 0) && !(T1_E == 0)) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && m_pc == 0) && !(m_st == 0))) || ((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) [2021-01-06 19:25:20,696 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(T1_E == 0)) && !(m_st == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) [2021-01-06 19:25:20,696 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,696 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((!(E_1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) [2021-01-06 19:25:20,696 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,696 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) [2021-01-06 19:25:20,697 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,697 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,697 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) [2021-01-06 19:25:20,697 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) [2021-01-06 19:25:20,700 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) [2021-01-06 19:25:20,788 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/token_ring.01.cil-1.c-witness.graphml [2021-01-06 19:25:20,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:25:20,790 INFO L168 Benchmark]: Toolchain (without parser) took 33028.77 ms. Allocated memory was 175.1 MB in the beginning and 367.0 MB in the end (delta: 191.9 MB). Free memory was 149.2 MB in the beginning and 183.2 MB in the end (delta: -34.1 MB). Peak memory consumption was 158.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:20,790 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 175.1 MB. Free memory is still 148.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:25:20,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.61 ms. Allocated memory is still 175.1 MB. Free memory was 149.0 MB in the beginning and 136.1 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:20,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 175.1 MB. Free memory was 135.9 MB in the beginning and 133.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:20,791 INFO L168 Benchmark]: Boogie Preprocessor took 83.92 ms. Allocated memory is still 175.1 MB. Free memory was 133.4 MB in the beginning and 131.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:20,792 INFO L168 Benchmark]: RCFGBuilder took 982.18 ms. Allocated memory is still 175.1 MB. Free memory was 131.5 MB in the beginning and 127.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:20,793 INFO L168 Benchmark]: TraceAbstraction took 31345.52 ms. Allocated memory was 175.1 MB in the beginning and 367.0 MB in the end (delta: 191.9 MB). Free memory was 126.9 MB in the beginning and 193.2 MB in the end (delta: -66.3 MB). Peak memory consumption was 196.9 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:20,793 INFO L168 Benchmark]: Witness Printer took 187.26 ms. Allocated memory is still 367.0 MB. Free memory was 193.2 MB in the beginning and 183.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:20,798 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 175.1 MB. Free memory is still 148.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 342.61 ms. Allocated memory is still 175.1 MB. Free memory was 149.0 MB in the beginning and 136.1 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 175.1 MB. Free memory was 135.9 MB in the beginning and 133.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 83.92 ms. Allocated memory is still 175.1 MB. Free memory was 133.4 MB in the beginning and 131.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 982.18 ms. Allocated memory is still 175.1 MB. Free memory was 131.5 MB in the beginning and 127.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 31345.52 ms. Allocated memory was 175.1 MB in the beginning and 367.0 MB in the end (delta: 191.9 MB). Free memory was 126.9 MB in the beginning and 193.2 MB in the end (delta: -66.3 MB). Peak memory consumption was 196.9 MB. Max. memory is 8.0 GB. * Witness Printer took 187.26 ms. Allocated memory is still 367.0 MB. Free memory was 193.2 MB in the beginning and 183.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || (((((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) || (((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) && !(m_st == 0)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((!(E_1 == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && __retres1 == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0))) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || (((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((E_1 == M_E && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) || (((((((((((((E_1 == M_E && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((\result == 0 && !(E_1 == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((((!(E_1 == 0) && local + 1 <= token) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || (((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && \result == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: (((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && m_st == 0) && local <= token) && m_pc == 0) && 2 <= E_M - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((E_1 == M_E && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && M_E == 2) && t1_i == 1) && !(m_st == 0)) && m_pc == 0) && 2 <= E_M) || ((((((((((E_1 == M_E && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && local <= token) && m_pc == 0) && 2 <= E_M) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 352]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(E_1 == 0) && \result == 0) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((!(t1_pc == 1) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && !(t1_pc == 1)) && \result == 0) && tmp == 0) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((((\result == 0 && !(E_1 == 0)) && __retres1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || (((((((((((\result == 0 && !(E_1 == 0)) && local + 1 <= token) && t1_pc == 1) && __retres1 == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0))) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && m_st == 0) && !(T1_E == 0)) || ((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && m_pc == 0) && !(m_st == 0))) || ((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: ((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) || (((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && \result == 0) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((((((((((E_1 == M_E && \result == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && M_E == 2) && t1_i == 1) && !(m_st == 0)) && m_pc == 0) && 2 <= E_M) || (((((((((((E_1 == M_E && \result == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && local <= token) && m_pc == 0) && 2 <= E_M) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: (((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && token <= local) && M_E == 2) && m_pc == 0) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && local <= token) && 2 <= E_M) || ((((((((((((((\result == 0 && E_1 == M_E) && tmp == 0) && T1_E == M_E) && M_E == 2) && !(m_st == 0)) && m_pc == 0) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && t1_st == 0) && m_pc == t1_pc) && t1_i == 1) && 2 <= E_M) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((!(E_1 == 0) && t1_pc == 1) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && local <= token) && !(T1_E == 0)) && !(m_st == 0)) && 2 <= E_M) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(T1_E == 0)) && !(m_st == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) - InvariantResult [Line: 464]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 162]: Loop Invariant Derived loop invariant: (((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && m_st == 0) && local <= token) && m_pc == 0) && 2 <= E_M - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 405]: Loop Invariant Derived loop invariant: t1_i == 1 - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((!(E_1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: ((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && M_E == 2) && t1_i == 1) && !(m_st == 0)) && m_pc == 0) && 2 <= E_M) || (((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && local <= token) && m_pc == 0) && 2 <= E_M) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0)) || ((((((((!(E_1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((!(E_1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((((((\result == 0 && !(E_1 == 0)) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || ((((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 0)) && m_pc == 0) && !(m_st == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((!(E_1 == 0) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && m_pc == 0) && !(m_st == 0))) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((((((!(E_1 == 0) && local + 1 <= token) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0)) || (((((((!(E_1 == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && !(m_st == 0))) || ((((((!(E_1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((\result == 0 && !(t1_pc == 1)) && !(E_1 == 0)) && __retres1 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) || ((((((((((!(E_1 == 0) && t1_pc == 1) && __retres1 == 0) && !(T1_E == 1)) && token <= local) && t1_i == 1) && !(t1_st == 0)) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && M_E == 2) && t1_i == 1) && !(m_st == 0)) && m_pc == 0) && 2 <= E_M) || (((((((((E_1 == M_E && t1_st == 0) && m_pc == t1_pc) && T1_E == M_E) && token <= local) && M_E == 2) && t1_i == 1) && local <= token) && m_pc == 0) && 2 <= E_M) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || ((((((((((!(E_1 == 0) && t1_pc == 1) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token <= local) && local <= token) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || ((((((((((local + 1 <= token && !(E_1 == 0)) && t1_pc == 1) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && !(t1_st == 0)) && m_st == 0) && !(T1_E == 0)) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0)) || ((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((((((((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(t1_st == 0)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(t1_st == 0)) && !(T1_E == 0)) && m_pc == 0) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && !(E_1 == 1)) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(t1_st == 0)) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0))) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && !(t1_st == 0)) && !(T1_E == 0)) && local + 1 <= token) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && token < local + 2) && 2 <= E_M)) || (((((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && m_pc == 0) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || ((((((((((((!(E_1 == 0) && tmp == 0) && !(E_1 == 1)) && token <= local) && !(T1_E == 0)) && !(m_st == 0)) && t1_pc == 1) && \result == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && local <= token) && 2 <= E_M)) || (((((((((((((\result == 0 && !(E_1 == 0)) && tmp == 0) && !(E_1 == 1)) && !(m_st == 0)) && !(T1_E == 0)) && !(t1_pc == 1)) && \result == 0) && __retres1 == 0) && tmp___0 == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && 2 <= E_M)) || (((((((((!(E_1 == 0) && \result == 0) && tmp == 0) && __retres1 == 0) && !(T1_E == 1)) && t1_i == 1) && !(T1_E == 0)) && 2 <= E_M) && !(m_st == 0)) && m_pc == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.7s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 25.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3489 SDtfs, 4847 SDslu, 3456 SDs, 0 SdLazy, 438 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2384occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1336 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 52 PreInvPairs, 754 NumberOfFragments, 13062 HoareAnnotationTreeSize, 52 FomulaSimplifications, 173500 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 52 FomulaSimplificationsInter, 52495 FormulaSimplificationTreeSizeReductionInter, 22.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1006 NumberOfCodeBlocks, 1006 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 989 ConstructedInterpolants, 0 QuantifiedInterpolants, 137219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 174/174 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 correct! Received shutdown request...